Sciweavers

989 search results - page 25 / 198
» Pebbling and Proofs of Work
Sort
View
TAMC
2010
Springer
14 years 1 months ago
Algebraic Proofs over Noncommutative Formulas
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 ...
Iddo Tzameret
ENTCS
2006
113views more  ENTCS 2006»
13 years 8 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
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...
Ian Wehrman, Aaron Stump
JCS
2010
121views more  JCS 2010»
13 years 6 months ago
Computational soundness of symbolic zero-knowledge proofs
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...
Michael Backes, Dominique Unruh
TPHOL
1999
IEEE
14 years 18 days ago
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
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...
Markus Wenzel
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 8 months ago
An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel
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...
Ersen Ekrem, Sennur Ulukus