989 search results - page 69 / 198 » Pebbling and Proofs of Work |
155
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
157
click to vote
LFCS
1992
Springer
15 years 10 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
166
click to vote
FLOPS
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...
170
click to vote
RIVF
2008
15 years 7 months ago
2008
In this work we present the principles of a flexible quantum key distribution (QKD) system using quadraturephase-shift-keying (QPSK) base and symbol encoding and dualthreshold bala...
161
click to vote
APAL
2008
15 years 6 months ago
2008
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...