CSDL - Proceedings C

Committees (PDF)

pp. ix

Reviewers (PDF)

pp. x

Awards (PDF)

pp. xi

Session 1

Godel and Computations (Abstract)

Pavel Pudlak, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK

pp. 3-5

PDF

Session 2

Polynomial Identity Testing for Depth 3 Circuits (Abstract)

Neeraj Kayal, IIT Kanpur, India

Nitin Saxena, IIT Kanpur, India

pp. 9-17

PDF

Every Linear Threshold Function has a Low-Weight Approximator (Abstract)

Rocco A. Servedio, Columbia University, USA

pp. 18-32

PDF

Session 3

Constructions of Low-Degree and Error-Correcting \in-Biased Generators (Abstract)

Amir Shpilka, Technion, Israel

pp. 33-45

PDF

How to Get More Mileage from Randomness Extractors (Abstract)

Ronen Shaltiel, University of Haifa, Israel

pp. 46-60

PDF

Exposure-Resilient Extractors (Abstract)

Marius Zimand, Towson University, USA

pp. 61-72

PDF

Session 4

Making Hard Problems Harder (Abstract)

Joshua Buresh-Oppenheim, Simon Fraser University, Canada

Rahul Santhanam, Simon Fraser University, Canada

pp. 73-87

PDF

Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries (Abstract)

Albert Atserias, Universitat Politecnica de Catalunya, Spain

pp. 88-95

PDF

Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness (Abstract)

Rafael Pass, CSAIL, MIT

pp. 96-110

PDF

Session 5

Applications of the Sum-Product Theorem in Finite Fields (PDF)

Avi Wigderson, Princeton, USA

pp. 111

Session 6

Constructing Ramsey Graphs from Boolean Function Representations (Abstract)

Parikshit Gopalan, Georgia Institute of Technology, USA

pp. 115-128

PDF

A Generic Time Hierarchy for Semantic Models with One Bit of Advice (Abstract)

Dieter van Melkebeek, University of Wisconsin - Madison, USA

Konstantin Pervyshev, St. Petersburg State University, Russia

pp. 129-144

PDF

Session 7

Hardness of the Covering Radius Problem on Lattices (Abstract)

Ishay Haviv, Tel Aviv University, Israel

Oded Regev, Tel Aviv University, Israel

pp. 145-158

PDF

A 3-Query Non-Adaptive PCP with Perfect Completeness (Abstract)

Subhash Khot, Georgia Institute of Technology, USA

Rishi Saket, Georgia Institute of Technology, USA

pp. 159-169

PDF

New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy (Abstract)

Iannis Tourlakis, Princeton University, USA

pp. 170-182

PDF

Session 8

FO[\le]-Uniformity (Abstract)

Christoph Behl, Universitat Tubingen, Germany

Klaus-Jorn Lange, Universitat Tubingen, Germany

pp. 183-189

PDF

Circuit Lower Bounds via Ehrenfeucht-Fraisse Games (Abstract)

Michal Koucky, Mathematical Institute, AS CR, Czech Republic

Clemens Lautemann, Johannes Gutenberg-Universitat, Germany

Sebastian Poloczek, Johannes Gutenberg-Universitat, Germany

Denis Therien, McGill University, Canada

pp. 190-201

PDF

On Modular Counting with Polynomials (Abstract)

Kristoffer Arnsfelt Hansen, University of Aarhus, Denmark

pp. 202-212

PDF

Session 9

Learning Monotone Decision Trees in Polynomial Time (Abstract)

Ryan O' Donnell, Microsoft Research, USA

Rocco A. Servedio, Columbia University, USA

pp. 213-225

PDF

Optimal Hardness Results for Maximizing Agreements with Monomials (Abstract)

Vitaly Feldman, Harvard University, USA

pp. 226-236

PDF

Session 10

Minimizing DNF Formulas and AC^0_d Circuits Given a Truth Table (Abstract)

Eric Allender, Rutgers University, USA

Lisa Hellerstein, Polytechnic University, USA

Paul McCabe, University of Toronto, Canada

Toniann Pitassi, University of Toronto, Canada

Michael Saks, Rutgers University, USA

pp. 237-251

PDF

A Duality between Clause Width and Clause Density for SAT (Abstract)

Chris Calabro, University of California, San Diego, USA

Russell Impagliazzo, University of California, San Diego, USA

Ramamohan Paturi, University of California, San Diego, USA

pp. 252-260

PDF

Session 11

QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols (Abstract)

Scott Aaronson, University of Waterloo

pp. 261-273

PDF

Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem (Abstract)

Pranab Sen, NEC Laboratories America, Inc. USA

pp. 274-287

PDF

Strengths and Weaknesses of Quantum Fingerprinting (Abstract)

Dmitry Gavinsky, University of Calgary

Julia Kempe, Univ. de Paris-Sud, France

Ronald de Wolf, CWI, Amsterdam

pp. 288-298

PDF

Session 12

Grid Graph Reachability Problems (Abstract)

Eric Allender, Rutgers University, USA

David A. Mix Barrington, University of Massachusetts Amherst, USA

Tanmoy Chakraborty, Chennai Mathematical Institute, India

Samir Datta, Chennai Mathematical Institute, India

Sambuddha Roy, Rutgers University, USA

pp. 299-313

PDF

An Isomorphism between Subexponential and Parameterized Complexity Theory (Abstract)

Yijia Chen, Shanghai Jiaotong University, China

Martin Grohe, Humboldt-Universitat, Germany

pp. 314-330

PDF

Session 13

On the Complexity of Numerical Analysis (Abstract)

Eric Allender, Rutgers, the State University of NJ, USA

Peter Burgisser, Paderborn University, Germany

Johan Kjeldgaard-Pedersen, Decision Sciences Practice, Denmark

Peter Bro Miltersen, University of Aarhus, Denmark

pp. 331-339

PDF

Oracles Are Subtle But Not Malicious (Abstract)

Scott Aaronson, University of Waterloo

pp. 340-354

PDF

Derandomization of Probabilistic Auxiliary Pushdown Automata Classes (Abstract)

H. Venkateswaran, Georgia Institute of Technology, USA

pp. 355-370

PDF

Author Index

Author Index (PDF)

pp. 371