Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
From MaRDI portal
Publication:5449840
DOI10.1007/11672142_55zbMath1137.68027OpenAlexW1509697755MaRDI QIDQ5449840
Emanuele Viola, Alexander D. Healy
Publication date: 19 March 2008
Published in: STACS 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11672142_55
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Perfect secure computation in two rounds, Local expanders, Worst-Case to Average-Case Reductions for Subclasses of P, On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1, SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption, Perfect Secure Computation in Two Rounds, Efficient Sample Extractors for Juntas with Applications, Quantum Hardness of Learning Shallow Classical Circuits, Dynamic complexity of expansion