Computational Complexity (CCC), 2012 IEEE 27th Annual Conference on
Date 26-29 June 2012
Filter Results
Displaying Results 1 - 25 of 48
-
[Cover art]
|
PDF (913 KB)
-
[Title page i]
|
PDF (913 KB)
-
[Title page iii]
|
PDF (110 KB)
-
[Copyright notice]
|
PDF (120 KB)
-
Table of contents
|
PDF (131 KB)
-
Preface
|
PDF (102 KB)
-
Organizing Committee
|
PDF (95 KB)
-
Program Committee
|
PDF (89 KB)
-
Reviewers
|
PDF (77 KB)
-
Awards
|
PDF (78 KB)
-
-
-
Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games
|
PDF (321 KB)
-
-
Quantum Money with Classical Verification
|
PDF (272 KB)
-
On the Usefulness of Predicates
|
PDF (250 KB)
-
Reductions between Expansion Problems
|
PDF (308 KB)
-
On Problems as Hard as CNF-SAT
|
PDF (298 KB)
-
Testing List H-homomorphisms
|
PDF (310 KB)
-
A Dichotomy for Real Weighted Holant Problems
|
PDF (285 KB)
-
A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis
|
PDF (277 KB)
-
Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT
|
PDF (276 KB)
-
-
-
Gaussian Noise Sensitivity and Fourier Tails
|
PDF (325 KB)
HTML
