2013 IEEE Conference on Computational Complexity
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

9780769549972

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Constructing Hard Functions Using Learning Algorithms

2013 IEEE Conference on Computational Complexity ◽

10.1109/ccc.2013.18 ◽

2013 ◽

Cited By ~ 3

Author(s):

Adam Klivans ◽

Pravesh Kothari ◽

Igor C. Oliveira

Keyword(s):

Learning Algorithms

Download Full-text

2013 IEEE Conference on Computational Complexity ◽

10.1109/ccc.2013.4 ◽

2013 ◽

Download Full-text

Composition Limits and Separating Examples for Some Boolean Function Complexity Measures

2013 IEEE Conference on Computational Complexity ◽

10.1109/ccc.2013.27 ◽

2013 ◽

Cited By ~ 2

Author(s):

Justin Gilmer ◽

Michael Saks ◽

Srikanth Srinivasan

Keyword(s):

Boolean Function ◽

Complexity Measures

Download Full-text

LS+ Lower Bounds from Pairwise Independence

2013 IEEE Conference on Computational Complexity ◽

10.1109/ccc.2013.21 ◽

2013 ◽

Cited By ~ 6

Author(s):

Madhur Tulsiani ◽

Pratik Worah

Keyword(s):

Lower Bounds ◽

Pairwise Independence

Download Full-text

On the Lattice Smoothing Parameter Problem

2013 IEEE Conference on Computational Complexity ◽

10.1109/ccc.2013.31 ◽

2013 ◽

Cited By ~ 8

Author(s):

Kai-Min Chung ◽

Daniel Dadush ◽

Feng-Hao Liu ◽

Chris Peikert

Keyword(s):

Smoothing Parameter ◽

Parameter Problem

Download Full-text

Quantum XOR Games

2013 IEEE Conference on Computational Complexity ◽

10.1109/ccc.2013.23 ◽

2013 ◽

Cited By ~ 7

Author(s):

Oded Regev ◽

Thomas Vidick

Download Full-text

How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?

2013 IEEE Conference on Computational Complexity ◽

10.1109/ccc.2013.26 ◽

2013 ◽

Author(s):

Andris Ambainis ◽

Ronald de Wolf

Keyword(s):

Boolean Functions ◽

Query Complexity ◽

Quantum Query Complexity ◽

Quantum Query

Download Full-text

Author index

2013 IEEE Conference on Computational Complexity ◽

10.1109/ccc.2013.38 ◽

2013 ◽

Download Full-text

Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover

2013 IEEE Conference on Computational Complexity ◽

10.1109/ccc.2013.30 ◽

2013 ◽

Cited By ~ 7

Author(s):

Sushant Sachdeva ◽

Rishi Saket

Keyword(s):

Vertex Cover ◽

Scheduling Problems

Download Full-text

Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole Principle

2013 IEEE Conference on Computational Complexity ◽

10.1109/ccc.2013.20 ◽

2013 ◽

Cited By ~ 2

Author(s):

Albert Atserias ◽

Moritz Muller ◽

Sergi Oliva

Keyword(s):

Lower Bounds ◽

Pigeonhole Principle

Download Full-text

2013 IEEE Conference on Computational Complexity
Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Constructing Hard Functions Using Learning Algorithms

Table of Contents

Composition Limits and Separating Examples for Some Boolean Function Complexity Measures

LS+ Lower Bounds from Pairwise Independence

On the Lattice Smoothing Parameter Problem

Quantum XOR Games

How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?

Author index

Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover

Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole Principle

Export Citation Format

2013 IEEE Conference on Computational ComplexityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

Constructing Hard Functions Using Learning Algorithms

Table of Contents

Composition Limits and Separating Examples for Some Boolean Function Complexity Measures

LS+ Lower Bounds from Pairwise Independence

On the Lattice Smoothing Parameter Problem

Quantum XOR Games

How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?

Author index

Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover

Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole Principle

2013 IEEE Conference on Computational Complexity
Latest Publications