60 search results - page 2 / 12 » An exponential separation between regular and general resolu... |
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
Many source separation algorithms fail to deliver robust performance when applied to signals recorded using highdensity microphone arrays where distance between sensor elements is...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and i...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
ALGORITHMICA
2002
13 years 5 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...