3208 search results - page 6 / 642 » A Lower Bound for Primality |
TIT
2010
13 years 2 months ago
2010
In this paper, a new class of Bayesian lower bounds is proposed. Derivation of the proposed class is performed via projection of each entry of the vector-function to be estimated ...
FOCS
2002
IEEE
14 years 18 days ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
FOCS
2002
IEEE
14 years 18 days ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
TAPAS
2011
13 years 2 months ago
2011
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
FMCAD
2004
Springer
14 years 1 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...