32 search results - page 1 / 7 » A sharp threshold in proof complexity |
STOC
2001
ACM
14 years 5 months ago
2001
ACM
TPHOL
2000
IEEE
13 years 9 months ago
2000
IEEE
We provide a proof using HOL and SPIN of convergence for the Routing Information Protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp re...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
PICS
2001
13 years 6 months ago
2001
Banding can be a major defect in inkjet printing. Knowing the visual sensitivity threshold of inkjet banding is therefore useful for understanding and pushing the technological li...