Establishes AKS primality correctness in VTC^0_2 by proving key number-theoretic facts in weaker theories and showing two algebraic axioms are derivable there.
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic.Logical Methods in Computer Science, 11
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Feasibility of Primality in Bounded Arithmetic
Establishes AKS primality correctness in VTC^0_2 by proving key number-theoretic facts in weaker theories and showing two algebraic axioms are derivable there.