71 search results - page 4 / 15 » Resolution Proofs, Exponential Bounds, and Kolmogorov Comple... |
EUROGP
2001
Springer
15 years 2 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
FOCS
2002
IEEE
15 years 2 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...
SAT
2010
Springer
15 years 1 months ago
2010
Springer
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...