18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc

0769518796

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Near-optimal lower bounds on the multi-party communication complexity of set disjointness

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. ◽

10.1109/ccc.2003.1214414 ◽

2004 ◽

Cited By ~ 48

Author(s):

A. Chakrabarti ◽

S. Khot ◽

Xiaodong Sun

Keyword(s):

Lower Bounds ◽

Communication Complexity

Download Full-text

Quantum certificate complexity

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. ◽

10.1109/ccc.2003.1214418 ◽

2004 ◽

Cited By ~ 2

Author(s):

S. Aaronson

Download Full-text

Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. ◽

10.1109/ccc.2003.1214408 ◽

2004 ◽

Cited By ~ 2

Author(s):

D. Gutfreund ◽

R. Shaltiel ◽

A. Ta-Shma

Download Full-text

On statistical query sampling and NMR quantum computing

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. ◽

10.1109/ccc.2003.1214420 ◽

2004 ◽

Author(s):

A. Blum ◽

K. Yang

Keyword(s):

Quantum Computing

Download Full-text

Rectangle size bounds and threshold covers in communication complexity

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. ◽

10.1109/ccc.2003.1214415 ◽

2004 ◽

Cited By ~ 20

Author(s):

H. Klauck

Keyword(s):

Communication Complexity

Download Full-text

Bounded nondeterminism and alternation in parameterized complexity theory

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. ◽

10.1109/ccc.2003.1214407 ◽

2004 ◽

Cited By ~ 10

Author(s):

Y. Chen ◽

J. Flum ◽

M. Grohe

Keyword(s):

Complexity Theory ◽

Parameterized Complexity ◽

Bounded Nondeterminism

Download Full-text

Quantum query complexity and semi-definite programming

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. ◽

10.1109/ccc.2003.1214419 ◽

2004 ◽

Cited By ~ 18

Author(s):

H. Barnum ◽

M. Saks ◽

M. Szegedy

Keyword(s):

Query Complexity ◽

Quantum Query Complexity ◽

Quantum Query

Download Full-text

Memoization and DPLL: formula caching proof systems

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. ◽

10.1109/ccc.2003.1214425 ◽

2004 ◽

Cited By ~ 9

Author(s):

P. Beame ◽

R. Impagliazzo ◽

T. Pitassi ◽

N. Segerlind

Keyword(s):

Proof Systems

Download Full-text

Optimal separation of EROW and CROW PRAMs

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. ◽

10.1109/ccc.2003.1214413 ◽

2004 ◽

Author(s):

N. Goyal ◽

M. Saks ◽

S. Venkatesh

Keyword(s):

Optimal Separation

Download Full-text

Are Cook and Karp ever the same?

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. ◽

10.1109/ccc.2003.1214431 ◽

2004 ◽

Cited By ~ 1

Author(s):

R. Beigel ◽

L. Fortnow

Download Full-text

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc

Near-optimal lower bounds on the multi-party communication complexity of set disjointness

Quantum certificate complexity

Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games

On statistical query sampling and NMR quantum computing

Rectangle size bounds and threshold covers in communication complexity

Bounded nondeterminism and alternation in parameterized complexity theory

Quantum query complexity and semi-definite programming

Memoization and DPLL: formula caching proof systems

Optimal separation of EROW and CROW PRAMs

Are Cook and Karp ever the same?

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
Latest Publications