Sciweavers

989 search results - page 45 / 198
» Pebbling and Proofs of Work
Sort
View
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 8 months ago
Inductive types in the Calculus of Algebraic Constructions
In a previous work, we proved that almost all of the Calculus of Inductive Constructions (CIC), the basis of the proof assistant Coq, can be seen as a Calculus of Algebraic Constru...
Frédéric Blanqui
JCT
2007
149views more  JCT 2007»
13 years 7 months ago
Weighted forms of Euler's theorem
In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan’s “lost” notebook, we obtain weighted forms of Euler’s theorem on part...
William Y. C. Chen, Kathy Q. Ji
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 6 months ago
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
Eric Goles Chacc, Bruno Martin
JCP
2010
100views more  JCP 2010»
13 years 6 months ago
Provable Secure Generalized Signcryption
Generalized signcryption which proposed by Han is a new cryptographic primitive which can work as an encryption scheme, a signature scheme or a signcryption scheme [5]. However,the...
Xu An Wang, Xiaoyuan Yang, Jindan Zhang
LPAR
2010
Springer
13 years 6 months ago
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
Jasmin Christian Blanchette, Koen Claessen