Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0769527809

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Quantum t-designs: t-wise Independence in the Quantum World

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) ◽

10.1109/ccc.2007.26 ◽

2007 ◽

Cited By ~ 27

Author(s):

Andris Ambainis ◽

Joseph Emerson

Download Full-text

A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) ◽

10.1109/ccc.2007.2 ◽

2007 ◽

Cited By ~ 5

Author(s):

Grant Schoenebeck ◽

Luca Trevisan ◽

Madhur Tulsiani

Keyword(s):

Lower Bound ◽

Vertex Cover

Download Full-text

An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) ◽

10.1109/ccc.2007.4 ◽

2007 ◽

Cited By ~ 2

Author(s):

Kei Uchizawa ◽

Eiji Takimoto

Keyword(s):

Lower Bound ◽

Constant Depth ◽

Small Energy ◽

Threshold Circuits ◽

Exponential Lower Bound

Download Full-text

Limits on the Hardness of Lattice Problems in \ell _p Norms

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) ◽

10.1109/ccc.2007.12 ◽

2007 ◽

Cited By ~ 9

Author(s):

Chris Peikert

Download Full-text

Bounded Queries and the NP Machine Hypothesis

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) ◽

10.1109/ccc.2007.7 ◽

2007 ◽

Cited By ~ 1

Author(s):

Richard Chang ◽

Suresh Purini

Keyword(s):

Bounded Queries

Download Full-text

Efficient Arguments without Short PCPs

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) ◽

10.1109/ccc.2007.10 ◽

2007 ◽

Cited By ~ 48

Author(s):

Yuval Ishai ◽

Eyal Kushilevitz ◽

Rafail Ostrovsky

Download Full-text

Understanding Parallel Repetition Requires Understanding Foams

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) ◽

10.1109/ccc.2007.39 ◽

2007 ◽

Cited By ~ 9

Author(s):

Uriel Feige ◽

Guy Kindler ◽

Ryan O'Donnell

Keyword(s):

Parallel Repetition

Download Full-text

Low-Depth Witnesses are Easy to Find

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) ◽

10.1109/ccc.2007.13 ◽

2007 ◽

Cited By ~ 2

Author(s):

Luis Antunes ◽

Lance Fortnow ◽

Alexandre Pinto ◽

Andre Souto

Download Full-text

Parity Problems in Planar Graphs

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) ◽

10.1109/ccc.2007.23 ◽

2007 ◽

Cited By ~ 2

Author(s):

Mark Braverman ◽

Raghav Kulkarni ◽

Sambuddha Roy

Keyword(s):

Planar Graphs

Download Full-text

Awards [2 awards]

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) ◽

10.1109/ccc.2007.1 ◽

2007 ◽

Download Full-text

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Quantum t-designs: t-wise Independence in the Quantum World

A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover

An Exponential Lower Bound on the Size of Constant-Depth Threshold Circuits with Small Energy Complexity

Limits on the Hardness of Lattice Problems in \ell _p Norms

Bounded Queries and the NP Machine Hypothesis

Efficient Arguments without Short PCPs

Understanding Parallel Repetition Requires Understanding Foams

Low-Depth Witnesses are Easy to Find

Parity Problems in Planar Graphs

Awards [2 awards]

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)
Latest Publications