Cyclotomic identity testing and applications
From MaRDI portal
Publication:6666517
DOI10.1145/3452143.3465530MaRDI QIDQ6666517
Mahsa Shirmohammadi, James Worrell, Sylvain Perifel, Nikhil Balaji
Publication date: 20 January 2025
cyclotomic fieldsstraight line programspolynomial identity testingrandomised algorithmscyclotomic integers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- New NP-hard and NP-complete polynomial and integer divisibility problems
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Non-commutative arithmetic circuits: depth reduction and size lower bounds
- On the equation \(\varphi_n(x) = 0\).
- On the theory of circle division
- Efficient algorithms for sparse cyclotomic integer zero testing
- Hilbert's Nullstellensatz is in the polynomial hierarchy
- Topics in multiplicative number theory
- Faster Fully Compressed Pattern Matching by Recompression
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications
- Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
- Fast Parallel Computation of Polynomials Using Few Processors
- Statistical Evidence for Small Generating Sets
- Primality and identity testing via Chinese remaindering
- Diagonal Circuit Identity Testing and Lower Bounds
- On the Complexity of Numerical Analysis
- A taxonomy of problems with fast parallel algorithms
- Log Depth Circuits for Division and Related Problems
- The parallel complexity of exponentiating polynomials over finite fields
- Parallel Prefix Computation
- On Threshold Circuits and Polynomial Computation
- Fast Multiple-Precision Evaluation of Elementary Functions
- The enhancement of Machin’s formula by Todd’s process
- Reducing Randomness via Irrational Numbers
This page was built for publication: Cyclotomic identity testing and applications
