scientific article
From MaRDI portal
Publication:2913810
DOI10.4086/TOC.2012.V008A010zbMath1247.68099OpenAlexW2293624083MaRDI QIDQ2913810
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography ⋮ Circular security is complete for KDM security ⋮ Negation-limited formulas
This page was built for publication:
