APPROX-RANDOM 2012 Special Issue
|
Vol 9, Article 12 (pp 437-439)
Special Issue: APPROX-RANDOM 2012: Guest Editors' Foreword by Alexandr Andoni and Atri Rudra |
|
Vol 9, Article 13 (pp 441-470)
Optimal Hitting Sets for Combinatorial Shapes by Aditya Bhaskara, Devendra Desai, and Srikanth Srinivasan |
|
Vol 9, Article 15 (pp 559-577)
Almost $k$-Wise vs. $k$-Wise Independent Permutations, and Uniformity for General Group Actions by Noga Alon and Shachar Lovett |
|
Vol 9, Article 21 (pp 665-683)
Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic by Eli Ben-Sasson and Ariel Gabizon |
|
Vol 9, Article 23 (pp 703-757)
Circumventing $d$-to-$1$ for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width at Least Four by Cenny Wenner |
|
Vol 9, Article 24 (pp 759-781)
Hardness of Vertex Deletion and Project Scheduling by Ola Svensson |
|
Vol 9, Article 25 (pp 783-807)
A New Upper Bound on the Query Complexity of Testing Generalized Reed-Muller Codes by Noga Ron-Zewi and Madhu Sudan |
|
Vol 10, Article 13 (pp 341-358)
Approximation Algorithm for Non-Boolean Max-$k$-CSP by Konstantin Makarychev and Yury Makarychev |
|
Vol 11, Article 7 (pp 221-235)
The Projection Games Conjecture and the NP-Hardness of ln $n$-Approximating Set-Cover by Dana Moshkovitz |