The black-box query complexity of polynomial summation
From MaRDI portal
Publication:626615
DOI10.1007/s00037-009-0263-7zbMath1213.68263OpenAlexW2074522341MaRDI QIDQ626615
Ali Juma, Valentine Kabanets, Amir Shpilka, Charles W. Rackoff
Publication date: 18 February 2011
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-009-0263-7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ Proof-carrying data from arithmetized random oracles ⋮ \textsf{VNP} = \textsf{VP} in the multilinear world
This page was built for publication: The black-box query complexity of polynomial summation
