Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5479390
DOI10.1007/11538462zbMath1142.05331MaRDI QIDQ5479390
Eyal Rozenman, Salil P. Vadhan
Publication date: 7 July 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11538462
Related Items
Expander Construction in VNC1, Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space, Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs, Unnamed Item, Pseudorandom generators for combinatorial checkerboards, Expander construction in \(\mathrm{VNC}^1\), Nonlinear spectral calculus and super-expanders, Derandomized constructions of \(k\)-wise (almost) independent permutations, Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting), Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs, Bravely, Moderately: A Common Theme in Four Recent Works, Expanding Generating Sets for Solvable Permutation Groups, Expander graphs and their applications