46 search results - page 1 / 10 » A constructive version of Birkhoff's theorem |
MLQ
2008
13 years 7 months ago
2008
CSR
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
MFCS
2001
Springer
13 years 12 months ago
2001
Springer
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead ...
SIAMCOMP
2000
13 years 7 months ago
2000
The main result is a finite-state version of the Kraft
CPC
2007
13 years 7 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...