Sciweavers

989 search results - page 71 / 198
» Pebbling and Proofs of Work
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
13 years 8 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere
COMPUTING
2007
118views more  COMPUTING 2007»
13 years 8 months ago
The construction of good extensible Korobov rules
In this paper we introduce construction algorithms for Korobov rules for numerical integration which work well for a given set of dimensions simultaneously. The existence of such ...
Josef Dick, Friedrich Pillichshammer, Benjamin J. ...
JANCL
2006
112views more  JANCL 2006»
13 years 8 months ago
KAT-ML: an interactive theorem prover for Kleene algebra with tests
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with K...
Kamal Aboul-Hosn, Dexter Kozen
ENTCS
2007
104views more  ENTCS 2007»
13 years 8 months ago
An Algebra of Pure Quantum Programming
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previou...
Thorsten Altenkirch, Jonathan Grattage, Juliana Ka...
TIT
2008
92views more  TIT 2008»
13 years 8 months ago
Capacity of Ultra-Wideband Power-Constrained Ad Hoc Networks
In this correspondence, we show that the uniform throughput capacity of an ultra-wideband (UWB) power-constrained ad hoc network is given by 2(P ( n=logn) ), where P is the per-nod...
Xiaojun Tang, Yingbo Hua