scientific article
From MaRDI portal
Publication:2913799
DOI10.4086/toc.2011.v007a012zbMath1247.68091OpenAlexW2183978808MaRDI QIDQ2913799
Dieter van Melkebeek, Scott Aaronson
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.2011.v007a012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
Pseudorandom generators for combinatorial checkerboards ⋮ Deterministic polynomial identity tests for multilinear bounded-read formulae ⋮ Pseudorandom generators, typically-correct derandomization, and circuit lower bounds ⋮ A Wronskian approach to the real \(\tau\)-conjecture ⋮ Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games ⋮ Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits
This page was built for publication:
