1132 search results - page 1 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
APAL
2005
13 years 6 months ago
2005
Pudl
COMBINATORICS
2002
13 years 6 months ago
2002
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.
ECCC
2010
13 years 5 months ago
2010
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...
UMC
2000
13 years 10 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
DCC
2008
IEEE
14 years 6 months ago
2008
IEEE
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....