Proceedings 15th Annual IEEE Conference on Computational Complexity
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc

0769506747

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the complexity of intersecting finite state automata

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856753 ◽

2002 ◽

Cited By ~ 1

Author(s):

G. Karakostas ◽

R.J. Lipton ◽

A. Viglas

Keyword(s):

Finite State Automata ◽

Finite State

Download Full-text

Time-space tradeoffs for nondeterministic computation

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856730 ◽

2002 ◽

Cited By ~ 12

Author(s):

L. Fortnow ◽

D. van Melkebeek

Keyword(s):

Time Space

Download Full-text

Characterization of non-deterministic quantum query and quantum communication complexity

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856758 ◽

2002 ◽

Cited By ~ 4

Author(s):

R. de Wolf

Keyword(s):

Communication Complexity ◽

Quantum Communication ◽

Quantum Communication Complexity ◽

Quantum Query

Download Full-text

On the hardness of 4-coloring a 3-collorable graph

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856749 ◽

2002 ◽

Cited By ~ 9

Author(s):

V. Guruswami ◽

S. Khanna

Download Full-text

An application of matroid theory to the SAT problem

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856741 ◽

2002 ◽

Cited By ~ 27

Author(s):

O. Kullmann

Keyword(s):

Matroid Theory ◽

Sat Problem

Download Full-text

Independent minimum length programs to translate between given strings

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856744 ◽

2002 ◽

Cited By ~ 1

Author(s):

N.K. Vereshchagin ◽

M.V. Vyugin

Keyword(s):

Minimum Length

Download Full-text

Average case complexity of unbounded fanin circuits

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856748 ◽

2002 ◽

Author(s):

A. Jakoby ◽

R. Rieschuk

Keyword(s):

Average Case ◽

Case Complexity ◽

Average Case Complexity

Download Full-text

Combinatorial interpretation of Kolmogorov complexity

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856743 ◽

2002 ◽

Cited By ~ 1

Author(s):

A. Romashchenko ◽

A. Shen ◽

N. Vereshchagin

Keyword(s):

Kolmogorov Complexity ◽

Combinatorial Interpretation

Download Full-text

Integer circuit evaluation is PSPACE-complete

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856751 ◽

2002 ◽

Cited By ~ 2

Author(s):

Ke Yang

Download Full-text

Easiness assumptions and hardness tests: trading time for zero error

Proceedings 15th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2000.856746 ◽

2002 ◽

Cited By ~ 7

Author(s):

V. Kabanets

Keyword(s):

Hardness Tests

Download Full-text

Proceedings 15th Annual IEEE Conference on Computational ComplexityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc

On the complexity of intersecting finite state automata

Time-space tradeoffs for nondeterministic computation

Characterization of non-deterministic quantum query and quantum communication complexity

On the hardness of 4-coloring a 3-collorable graph

An application of matroid theory to the SAT problem

Independent minimum length programs to translate between given strings

Average case complexity of unbounded fanin circuits

Combinatorial interpretation of Kolmogorov complexity

Integer circuit evaluation is PSPACE-complete

Easiness assumptions and hardness tests: trading time for zero error

Proceedings 15th Annual IEEE Conference on Computational Complexity
Latest Publications