2010 IEEE 25th Annual Conference on Computational Complexity
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

9781424472147

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.13 ◽

2010 ◽

Cited By ~ 1

Author(s):

Dan Gutfreund ◽

Akinori Kawachi

Keyword(s):

Lower Bounds ◽

Approximate Counting ◽

Exponential Size

The Partition Bound for Classical Communication Complexity and Query Complexity

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.31 ◽

2010 ◽

Cited By ~ 34

Author(s):

Rahul Jain ◽

Hartmut Klauck

Keyword(s):

Communication Complexity ◽

Query Complexity ◽

Classical Communication

On the Power of Randomized Reductions and the Checkability of SAT

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.16 ◽

2010 ◽

Cited By ~ 11

Author(s):

Mohammad Mahmoody ◽

David Xiao

Simple Affine Extractors Using Dimension Expansion

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.14 ◽

2010 ◽

Cited By ~ 8

Author(s):

Matt DeVos ◽

Ariel Gabizon

Keyword(s):

Dimension Expansion

Copyright Page

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.3 ◽

2010 ◽

Relationless Completeness and Separations

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.34 ◽

2010 ◽

Cited By ~ 4

Author(s):

Pavel Hrubes ◽

Avi Wigderson ◽

Amir Yehudayoff

Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.24 ◽

2010 ◽

Author(s):

Eric Allender ◽

Klaus-Jörn Lange

Keyword(s):

Pushdown Automata

Committees

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.6 ◽

2010 ◽

On Matrix Rigidity and Locally Self-Correctable Codes

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.35 ◽

2010 ◽

Cited By ~ 14

Author(s):

Zeev Dvir

Keyword(s):

Matrix Rigidity

Awards

2010 IEEE 25th Annual Conference on Computational Complexity ◽

10.1109/ccc.2010.8 ◽

2010 ◽

2010 IEEE 25th Annual Conference on Computational ComplexityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

The Partition Bound for Classical Communication Complexity and Query Complexity

On the Power of Randomized Reductions and the Checkability of SAT

Simple Affine Extractors Using Dimension Expansion

Copyright Page

Relationless Completeness and Separations

Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata

Committees

On Matrix Rigidity and Locally Self-Correctable Codes

Awards

2010 IEEE 25th Annual Conference on Computational Complexity
Latest Publications