1101 search results - page 87 / 221 » Forcing in proof theory |
82
Voted
CORR
2008
Springer
15 years 20 days ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
80
Voted
DM
2010
15 years 20 days ago
2010
We resolve affirmatively some conjectures of Reiner, Stanton, and White [6] regarding enumeration of various classes of matrices which are invariant under certain cyclic row and co...
99
Voted
ENGL
2007
15 years 17 days ago
2007
— The aim of the present work is to present a characterization of the Gentzen System G by means of a regulated grammar, according to the Formal Languages Theory. Given a proposit...
113
click to vote
ECCC
2011
14 years 4 months ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
199
Voted
POPL
2006
ACM
16 years 27 days ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...