scientific article
From MaRDI portal
Publication:3191575
DOI10.4086/toc.2013.v009a007zbMath1300.68037OpenAlexW91979434MaRDI QIDQ3191575
No author found.
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.v009a007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
A Sufficient Condition for Sets Hitting the Class of Read-Once Branching Programs of Width 3 ⋮ Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Simple Optimal Hitting Sets for Small-Success RL ⋮ Small Sample Spaces Cannot Fool Low Degree Polynomials ⋮ Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs ⋮ Unnamed Item ⋮ Near-optimal pseudorandom generators for constant-depth read-once formulas ⋮ Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits ⋮ A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3
Cites Work