3228 search results - page 317 / 646 » Computationally Sound Proofs |
131
click to vote
FOSSACS
2010
Springer
15 years 11 months ago
2010
Springer
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor...
124
click to vote
PDP
2009
IEEE
15 years 11 months ago
2009
IEEE
PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time...
BIRTHDAY
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating wellfoundedness of unions of relations. To that en...
137
click to vote
BIRTHDAY
2009
Springer
15 years 11 months ago
2009
Springer
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s...
130
click to vote
CASC
2009
Springer
15 years 11 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...