Sciweavers

Share
COCO
2001
Springer
102views Algorithms» more  COCO 2001»
10 years 2 months ago
Links Between Complexity Theory and Constrained Block Coding
Larry J. Stockmeyer, Dharmendra S. Modha
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
10 years 2 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
COCO
2001
Springer
102views Algorithms» more  COCO 2001»
10 years 2 months ago
Separation of NP-Completeness Notions
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...
Aduri Pavan, Alan L. Selman
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
10 years 2 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans
COCO
2001
Springer
107views Algorithms» more  COCO 2001»
10 years 2 months ago
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
COCO
2001
Springer
135views Algorithms» more  COCO 2001»
10 years 2 months ago
Simple Analysis of Graph Tests for Linearity and PCP
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
Johan Håstad, Avi Wigderson
COCO
2001
Springer
94views Algorithms» more  COCO 2001»
10 years 2 months ago
Tree Resolution Proofs of the Weak Pigeon-Hole Principle
Stefan S. Dantchev, Søren Riis
COCO
2001
Springer
106views Algorithms» more  COCO 2001»
10 years 2 months ago
Quantum Algorithmic Entropy
Péter Gács
COCO
2001
Springer
108views Algorithms» more  COCO 2001»
10 years 2 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
Richard Chang, Jon S. Squire
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
10 years 2 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
books