Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5313041
DOI10.1007/b99805zbMath1106.68368OpenAlexW4301133941MaRDI QIDQ5313041
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99805
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Local expanders ⋮ On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape ⋮ Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\) ⋮ Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? ⋮ Arithmetic circuits: the chasm at depth four gets wider ⋮ Unnamed Item ⋮ Typically-correct derandomization for small time and space ⋮ 3SUM, 3XOR, triangles
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
