10608 search results - page 481 / 2122 » Complexity of O'Hara's Algorithm |
83
Voted
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We continue the study of the trade-off between the length of PCPs and their query complexity, establishing the following main results (which refer to proofs of satisfiability of c...
122
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
: This paper gives two distinct proofs of an exponential separation between regular resolution and unrestricted resolution. The previous best known separation between these systems...
126
Voted
COCO
2001
Springer
15 years 9 months ago
2001
Springer
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...
188
click to vote
STOC
1996
ACM
15 years 9 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
154
Voted
COCO
2007
Springer
15 years 9 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...