290 search results - page 11 / 58 » Theorem Proving Using Lazy Proof Explication |
104
click to vote
ECCC
2006
14 years 9 months ago
2006
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
75
Voted
CADE
1992
Springer
15 years 1 months ago
1992
Springer
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
TCS
2008
14 years 9 months ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
AISC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
DM
1999
14 years 9 months ago
1999
Let Fk(x) = n=0 Fk n xn . Using the interpretation of Fibonacci numbers in the terms of Morse codes, we give a bijective proof of Riordan's formula (1 - Lkx + (-1)k x2 )Fk(x...