scientific article
From MaRDI portal
Publication:3191596
DOI10.4086/toc.2013.v009a026zbMath1298.81047OpenAlexW2610312456MaRDI QIDQ3191596
Emanuele Viola, Ronen Shaltiel, Christopher Umans, Bill Fefferman
Publication date: 6 October 2014
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2013.v009a026
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (11)
Quantified Derandomization: How to Find Water in the Ocean ⋮ Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization ⋮ Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates ⋮ Near-optimal pseudorandom generators for constant-depth read-once formulas ⋮ Algorithms and lower bounds for de morgan formulas of low-communication leaf gates ⋮ A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3
Cites Work
This page was built for publication:
