Sciweavers

8 search results - page 2 / 2
» A Combinatorial Consistency Lemma with Application to Provin...
Sort
View
IJCAI
2003
13 years 7 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 5 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 7 months ago
Constructive Proofs of Concentration Bounds
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 ...
Russell Impagliazzo, Valentine Kabanets