989 search results - page 150 / 198 » Pebbling and Proofs of Work |
ENTCS
2007
13 years 8 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
JSYML
2006
13 years 8 months ago
2006
Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that m Sm (the u...
FUIN
2007
13 years 8 months ago
2007
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
INFORMS
2007
13 years 7 months ago
2007
It has been shown in prior work in management science, statistics and machine learning that using an ensemble of models often results in better performance than using a single ‘...
IPL
2007
13 years 7 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...