179 search results - page 11 / 36 » The proof of Hermann's conjecture |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
COMBINATORICA
2008
13 years 7 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
ALP
1992
Springer
13 years 11 months ago
1992
Springer
The paper presents a new schematization of in nite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is...
ARSCOM
2002
13 years 7 months ago
2002
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...