2009 24th Annual IEEE Conference on Computational Complexity
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

9780769537177

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

[Cover art]

2009 24th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2009.45 ◽

2009 ◽

Keyword(s):

Cover Art

Download Full-text

Are PCPs Inherent in Efficient Arguments?

2009 24th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2009.40 ◽

2009 ◽

Cited By ~ 3

Author(s):

Guy N. Rothblum ◽

Salil Vadhan

Download Full-text

k-Subgraph Isomorphism on AC_0 Circuits

2009 24th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2009.23 ◽

2009 ◽

Author(s):

Kazuyuki Amano

Keyword(s):

Subgraph Isomorphism

Download Full-text

Every Permutation CSP of arity 3 is Approximation Resistant

2009 24th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2009.29 ◽

2009 ◽

Cited By ~ 18

Author(s):

Moses Charikar ◽

Venkatesan Guruswami ◽

Rajsekar Manokaran

Download Full-text

Fixed-Polynomial Size Circuit Bounds

2009 24th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2009.21 ◽

2009 ◽

Cited By ~ 6

Author(s):

Lance Fortnow ◽

Rahul Santhanam ◽

Ryan Williams

Keyword(s):

Polynomial Size

Download Full-text

An Approximation Algorithm for Approximation Rank

2009 24th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2009.25 ◽

2009 ◽

Cited By ~ 7

Author(s):

Troy Lee ◽

Adi Shraibman

Keyword(s):

Approximation Algorithm

Download Full-text

An Almost Optimal Rank Bound for Depth-3 Identities

2009 24th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2009.20 ◽

2009 ◽

Cited By ~ 7

Author(s):

Nitin Saxena ◽

C. Seshadhri

Download Full-text

Author Index

2009 24th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2009.43 ◽

2009 ◽

Download Full-text

Title Page iii

2009 24th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2009.2 ◽

2009 ◽

Keyword(s):

Title Page

Download Full-text

A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences

2009 24th Annual IEEE Conference on Computational Complexity ◽

10.1109/ccc.2009.31 ◽

2009 ◽

Cited By ~ 7

Author(s):

Joshua Brody ◽

Amit Chakrabarti

Keyword(s):

Lower Bound

Download Full-text

2009 24th Annual IEEE Conference on Computational ComplexityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

[Cover art]

Are PCPs Inherent in Efficient Arguments?

k-Subgraph Isomorphism on AC_0 Circuits

Every Permutation CSP of arity 3 is Approximation Resistant

Fixed-Polynomial Size Circuit Bounds

An Approximation Algorithm for Approximation Rank

An Almost Optimal Rank Bound for Depth-3 Identities

Author Index

Title Page iii

A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences

2009 24th Annual IEEE Conference on Computational Complexity
Latest Publications