Identity testing for radical expressions

DOI10.1145/3531130.3533331MaRDI QIDQ6649437zbMATH OpenFDO

Authors Nikhil Balaji, Mahsa Shirmohammadi, James Worrell

Publication date 6 December 2024

Full work available at URL https://doi.org/10.1145/3531130.3533331

zbMATH Keywords

computational complexitynumber fieldspolynomial identity testingrandomised algorithmsalgebraic circuits

Mathematics Subject Classification ID

Theory of computing (68Qxx) Density theorems (11R45)

Cites work

• scientific article; zbMATH DE number 3698383 (Why is no real title available?)
• scientific article; zbMATH DE number 3563269 (Why is no real title available?)
• scientific article; zbMATH DE number 3588048 (Why is no real title available?)
• scientific article; zbMATH DE number 1256682 (Why is no real title available?)
• scientific article; zbMATH DE number 1263350 (Why is no real title available?)
• scientific article; zbMATH DE number 1305089 (Why is no real title available?)
• scientific article; zbMATH DE number 2121181 (Why is no real title available?)
• scientific article; zbMATH DE number 3424129 (Why is no real title available?)
• A probabilistic remark on algebraic program testing
• Algebraic number theory and Fermat's last theorem.
• Algorithms and Computation
• Chebotarëv and his density theorem
• Convergence thresholds of Newton's method for monotone polynomial equations
• Counting problems for Parikh images
• Denesting by bounded degree radicals
• Factor Refinement
• Hilbert's Nullstellensatz is in the polynomial hierarchy
• How to recognize zero?
• LTL model checking of interval Markov chains
• Near-Optimal Complexity Bounds for Fragments of the Skolem Problem
• On probabilistic parallel programs with process creation and synchronisation
• On the Complexity of Equivalence and Minimisation for Q-weighted Automata
• On the Complexity of Nash Equilibria and Other Fixed Points
• On the Complexity of Numerical Analysis
• On the Sum of Square Roots of Polynomials and Related Problems
• On the complexity of linear arithmetic with divisibility
• On the complexity of pattern matching for highly compressed two-dimensional texts.
• On the complexity of the orbit problem
• PRIMES is in P
• Parallel identity testing for skew circuits with big powers and applications
• Primality and identity testing via Chinese remaindering
• Quelques applications du théorème de densité de Chebotarev
• Reducing Randomness via Irrational Numbers
• The Complexity of Nash Equilibria in Limit-Average Games
• The Compressed Word Problem for Groups
• The complexity of ergodic mean-payoff games
• The odds of staying on budget
• Transformation der Kurven auf zweiseitigen Flächen.

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)