21st Annual IEEE Conference on Computational Complexity (CCC'06)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0769525962

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Grid Graph Reachability Problems

21st Annual IEEE Conference on Computational Complexity (CCC'06) ◽

10.1109/ccc.2006.22 ◽

2006 ◽

Cited By ~ 6

Author(s):

E. Allender ◽

D.A. Mix Barrington ◽

T. Chakraborty ◽

S. Datta ◽

S. Roy

Keyword(s):

Grid Graph ◽

Graph Reachability

Download Full-text

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

21st Annual IEEE Conference on Computational Complexity (CCC'06) ◽

10.1109/ccc.2006.36 ◽

2006 ◽

Cited By ~ 2

Author(s):

S. Aaronson

Keyword(s):

Quantum Protocols

Download Full-text

Derandomization of Probabilistic Auxiliary Pushdown Automata Classes

21st Annual IEEE Conference on Computational Complexity (CCC'06) ◽

10.1109/ccc.2006.16 ◽

2006 ◽

Cited By ~ 1

Author(s):

H. Venkateswaran

Keyword(s):

Pushdown Automata

Download Full-text

Strengths and Weaknesses of Quantum Fingerprinting

21st Annual IEEE Conference on Computational Complexity (CCC'06) ◽

10.1109/ccc.2006.39 ◽

2006 ◽

Cited By ~ 4

Author(s):

D. Gavinsky ◽

J. Kempe ◽

R. de Wolf

Keyword(s):

Quantum Fingerprinting

Download Full-text

Circuit Lower Bounds via Ehrenfeucht-Fraisse Games

21st Annual IEEE Conference on Computational Complexity (CCC'06) ◽

10.1109/ccc.2006.12 ◽

2006 ◽

Cited By ~ 7

Author(s):

M. Koucky ◽

C. Lautemann ◽

S. Poloczek ◽

D. Therien

Keyword(s):

Lower Bounds ◽

Circuit Lower Bounds

Download Full-text

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

21st Annual IEEE Conference on Computational Complexity (CCC'06) ◽

10.1109/ccc.2006.28 ◽

2006 ◽

Cited By ~ 4

Author(s):

I. Tourlakis

Keyword(s):

Lower Bounds ◽

Vertex Cover

Download Full-text

A Duality between Clause Width and Clause Density for SAT

21st Annual IEEE Conference on Computational Complexity (CCC'06) ◽

10.1109/ccc.2006.6 ◽

2006 ◽

Cited By ~ 26

Author(s):

C. Calabro ◽

R. Impagliazzo ◽

R. Paturi

Download Full-text

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

21st Annual IEEE Conference on Computational Complexity (CCC'06) ◽

10.1109/ccc.2006.33 ◽

2006 ◽

Cited By ~ 5

Author(s):

R. Pass

Keyword(s):

Zero Knowledge ◽

Parallel Repetition ◽

Np Hardness

Download Full-text

Oracles Are Subtle But Not Malicious

21st Annual IEEE Conference on Computational Complexity (CCC'06) ◽

10.1109/ccc.2006.32 ◽

2006 ◽

Cited By ~ 6

Author(s):

S. Aaronson

Download Full-text

Making Hard Problems Harder

21st Annual IEEE Conference on Computational Complexity (CCC'06) ◽

10.1109/ccc.2006.26 ◽

2006 ◽

Cited By ~ 3

Author(s):

J. Buresh-Oppenheim ◽

R. Santhanam

Keyword(s):

Hard Problems

Download Full-text

21st Annual IEEE Conference on Computational Complexity (CCC'06)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Grid Graph Reachability Problems

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

Derandomization of Probabilistic Auxiliary Pushdown Automata Classes

Strengths and Weaknesses of Quantum Fingerprinting

Circuit Lower Bounds via Ehrenfeucht-Fraisse Games

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

A Duality between Clause Width and Clause Density for SAT

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

Oracles Are Subtle But Not Malicious

Making Hard Problems Harder

21st Annual IEEE Conference on Computational Complexity (CCC'06)
Latest Publications