Submissions Stats

• 119 submissions– Paris ‘09: 113 (deadline after STOC) Prague '06: 87

Aarhus '03: 65 Florence '00: 63 • 18 junk submissions• 34 papers accepted– Second highest ever? Paris ’09 had 37 papers– The 3 ½ day format offers some flexibility

• Two invited talks: – Peter Bürgisser & Toniann Pitassi

Subarea #submissions

#accepted

Classical, structural complexity (incl. logic) 16 5

Quantum 15 4

Pseudorandomness 11 6

Communication Complexity; lower bounds 9 3

Approximability 9 2

Cryptographic complexity 8 1

Sat. algos, parameterized complexity 5 3

Property testing 5 2

Algebraic complexity 5 3

Proof systems, PCPs 4 2

Proof complexity 3 1

Coding theory 3 1

Complexity related Math 3 1

Sundry 5 0

TOTAL 101 34

Papers by areas (approximate)

Conference on Computational

Complexity

The Ronald V. Book Prize for Best Student Paper of the

27th Conference on Computational Complexity, CCC’12

Andrew DruckerIs Awarded To

For the Paper

Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators

CCC’12 special issue of Computational Complexity journal

1. Amplifying Circuit Lower Bounds Against Polynomial Time With applications

2. Is the Valiant-Vazirani Isolation Lemma Improvable?3. Parallel approximation of min-max problems with applications

to classical and quantum zero-sum games4. A Satisfiability Algorithm and Average-Case Hardness for

Formulas over Full bInary basis 5. DNF Sparsification and Faster Deterministic Counting 6. A strong direct product theorem for quantum query complexity 7. On sunflowers and matrix multiplication