989 search results - page 25 / 198 » Pebbling and Proofs of Work |
115
Voted
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
101
click to vote
ENTCS
2006
15 years 1 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
114
click to vote
JCS
2010
15 years 10 days ago
2010
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
117
click to vote
TPHOL
1999
IEEE
15 years 6 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...
110
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We provide an alternative proof for the capacity region of the degraded Gaussian multiple-input multiple-output (MIMO) broadcast channel. Our proof does not use the channel enhanc...