1199 search results - page 132 / 240 » Parameterized Proof Complexity |
99
Voted
LICS
1989
IEEE
15 years 4 months ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
TALG
2008
15 years 17 days ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
TVLSI
2008
15 years 17 days ago
2008
Abstract--We present a refinement-based compositional framework for showing that pipelined machines satisfy the same safety and liveness properties as their non-pipelined specifica...
CCR
2000
15 years 15 days ago
2000
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
101
click to vote
SIAMCOMP
2002
15 years 9 days ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...