Zero Knowledge and Circuit Minimization
From MaRDI portal
Publication:2922592
DOI10.1007/978-3-662-44465-8_3zbMath1378.68056OpenAlexW126298714MaRDI QIDQ2922592
Bireswar Das, Eric W. Allender
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_3
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Discrete logarithm and minimum circuit size ⋮ Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs ⋮ The minimum oracle circuit size problem ⋮ The power of natural properties as oracles ⋮ The final nail in the coffin of statistically-secure obfuscator ⋮ The Complexity of Complexity ⋮ Minimum Circuit Size, Graph Isomorphism, and Related Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Circuit lower bounds from NP-hardness of MCSP under turing reductions
This page was built for publication: Zero Knowledge and Circuit Minimization
