2014 IEEE 29th Conference on Computational Complexity (CCC)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

9781479936267

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Reviewers

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.8 ◽

2014 ◽

On the Closest Vector Problem with a Distance Guarantee

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.18 ◽

2014 ◽

Cited By ~ 8

Author(s):

Daniel Dadush ◽

Oded Regev ◽

Noah Stephens-Davidowitz

Keyword(s):

Closest Vector Problem ◽

Vector Problem

Narrow Proofs May Be Maximally Long

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.36 ◽

2014 ◽

Cited By ~ 6

Author(s):

Albert Atserias ◽

Massimo Lauria ◽

Jakob Nordstrom

CCC 2014 Awards: 2014 Ronald V. Book Prize for the Best Student Paper

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.7 ◽

2014 ◽

Keyword(s):

Student Paper

Preface

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.5 ◽

2014 ◽

Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.16 ◽

2014 ◽

Cited By ~ 2

Author(s):

Rishi Saket

Keyword(s):

Independent Sets

On Physical Problems that are Slightly More Difficult than QMA

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.12 ◽

2014 ◽

Cited By ~ 4

Author(s):

Andris Ambainis

Keyword(s):

Physical Problems

Hitting Sets for Low-Degree Polynomials with Optimal Density

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.24 ◽

2014 ◽

Cited By ~ 2

Author(s):

Venkatesan Guruswami ◽

Chaoping Xing

Keyword(s):

Optimal Density ◽

Hitting Sets ◽

Low Degree ◽

Low Degree Polynomials

Mining Circuit Lower Bound Proofs for Meta-algorithms

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.34 ◽

2014 ◽

Cited By ~ 15

Author(s):

Ruiwen Chen ◽

Valentine Kabanets ◽

Antonina Kolokolova ◽

Ronen Shaltiel ◽

David Zuckerman

Keyword(s):

Lower Bound

Noncommutative Determinant is Hard: A Simple Proof Using an Extension of Barrington's Theorem

2014 IEEE 29th Conference on Computational Complexity (CCC) ◽

10.1109/ccc.2014.26 ◽

2014 ◽

Cited By ~ 3

Author(s):

Craig Gentry

Keyword(s):

Simple Proof ◽

Noncommutative Determinant

2014 IEEE 29th Conference on Computational Complexity (CCC)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Reviewers

On the Closest Vector Problem with a Distance Guarantee

Narrow Proofs May Be Maximally Long

CCC 2014 Awards: 2014 Ronald V. Book Prize for the Best Student Paper

Preface

Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs

On Physical Problems that are Slightly More Difficult than QMA

Hitting Sets for Low-Degree Polynomials with Optimal Density

Mining Circuit Lower Bound Proofs for Meta-algorithms

Noncommutative Determinant is Hard: A Simple Proof Using an Extension of Barrington's Theorem

2014 IEEE 29th Conference on Computational Complexity (CCC)
Latest Publications