The division breakthroughs

MaRDI QIDQ2743685zbMATH OpenFDO

Authors Eric Allender

Publication date 15 January 2004

Published in Bulletin of the European Association for Theoretical Computer Science EATCS (Search for Journal in Brave)

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited in

(5)

• Uniform constant-depth threshold circuits for division and iterated multiplication.
• Factoring and Testing Primes in Small Space
• Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\)
• Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\)
• Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}}

This page was built for publication: The division breakthroughs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743685)