989 search results - page 37 / 198 » Pebbling and Proofs of Work |
STOC
2012
ACM
11 years 10 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. A verified compiler is an integral part of every security infrastructure. Previous work has come up with formal semantics for sequential and concurrent variants of Java a...
CTCS
1997
Springer
14 years 14 days ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
TC
2011
13 years 3 months ago
2011
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
ECCC
2011
12 years 11 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...