New prime enumeration algorithms achieve N (log log N)^{1+o(1)} bit operations in the multitape Turing model, improving prior work by nearly log N via fast polynomial arithmetic over finite fields and error-correcting code ideas.
[BCS97] Peter Bürgisser, Michael Clausen, and Mohammad Amin Shokrollahi.Algebraic Complexity Theory, volume 315 ofGrundlehren Der Mathematischen Wissenschaften
4 Pith papers cite this work, alongside 1,058 external citations. Polarity classification is still indexing.
4
Pith papers citing it
1,058
external citations · OpenAlex
years
2026 4representative citing papers
Explicit construction of improved-size variety-evasive subspace families for degree-d varieties via better Chow-form hitting sets.
Upper and lower quantum functionals do not coincide for higher-order tensors but anchor new spectral points for laminar weightings on embedded three-tensors and W-like states.
citing papers explorer
-
Faster enumeration of primes
New prime enumeration algorithms achieve N (log log N)^{1+o(1)} bit operations in the multitape Turing model, improving prior work by nearly log N via fast polynomial arithmetic over finite fields and error-correcting code ideas.
-
An Improved Construction of Variety-Evasive Subspace Families
Explicit construction of improved-size variety-evasive subspace families for degree-d varieties via better Chow-form hitting sets.
-
On quantum functionals for higher-order tensors
Upper and lower quantum functionals do not coincide for higher-order tensors but anchor new spectral points for laminar weightings on embedded three-tensors and W-like states.
- Partition Rank and Algebraic Circuit Lower Bounds