Sciweavers

300 search results - page 27 / 60
» The Extension Theorem
Sort
View
AML
2011
204views Mathematics» more  AML 2011»
14 years 6 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
CPC
2006
132views more  CPC 2006»
14 years 11 months ago
Duality in Infinite Graphs
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
Henning Bruhn, Reinhard Diestel
88
Voted
CCA
2009
Springer
15 years 5 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
SCL
2008
79views more  SCL 2008»
14 years 11 months ago
Stability of block-triangular stationary random matrices
The objective of this note is to prove, under certain technical conditions, that the top-Lyapunov exponent of a strictly stationary random sequence of block-triangular matrices is...
László Gerencsér, György...
MPC
2010
Springer
157views Mathematics» more  MPC 2010»
15 years 3 months ago
Formal Derivation of Concurrent Garbage Collectors
Concurrent garbage collectors are notoriously difficult to implement correctly. Previous approaches to the issue of producing correct collectors have mainly been based on posit-and...
Dusko Pavlovic, Peter Pepper, Douglas R. Smith