Identity testing for radical expressions
From MaRDI portal
Publication:6649437
DOI10.1145/3531130.3533331MaRDI QIDQ6649437
James Worrell, Mahsa Shirmohammadi, Author name not available (Why is that?), Nikhil Balaji
Publication date: 6 December 2024
computational complexitynumber fieldspolynomial identity testingrandomised algorithmsalgebraic circuits
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quelques applications du théorème de densité de Chebotarev
- A probabilistic remark on algebraic program testing
- Chebotarëv and his density theorem
- How to recognize zero?
- Transformation der Kurven auf zweiseitigen Flächen.
- PRIMES is in P
- On the complexity of pattern matching for highly compressed two-dimensional texts.
- Hilbert's Nullstellensatz is in the polynomial hierarchy
- Algebraic number theory and Fermat's last theorem.
- On the Sum of Square Roots of Polynomials and Related Problems
- On Probabilistic Parallel Programs with Process Creation and Synchronisation
- On the Complexity of Nash Equilibria and Other Fixed Points
- The Complexity of Nash Equilibria in Limit-Average Games
- Factor Refinement
- On the Complexity of the Orbit Problem
- The Odds of Staying on Budget
- Primality and identity testing via Chinese remaindering
- On the Complexity of Numerical Analysis
- On the Complexity of Linear Arithmetic with Divisibility
- Parallel identity testing for skew circuits with big powers and applications
- Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
- On the Complexity of Equivalence and Minimisation for Q-weighted Automata
- Reducing Randomness via Irrational Numbers
- Counting problems for parikh images
- The Complexity of Ergodic Mean-payoff Games
- Algorithms and Computation
- LTL Model Checking of Interval Markov Chains
- The Compressed Word Problem for Groups
- Near-Optimal Complexity Bounds for Fragments of the Skolem Problem
- Denesting by bounded degree radicals
This page was built for publication: Identity testing for radical expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649437)
