351 search results - page 27 / 71 » Classical proof forestry |
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain informa...
PDP
2009
IEEE
14 years 2 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...
AIPS
2007
13 years 10 months ago
2007
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
CORR
2008
Springer
13 years 7 months 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...