1199 search results - page 58 / 240 » Parameterized Proof Complexity |
149
Voted
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
119
Voted
FROCOS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
WSC
1997
15 years 3 months ago
1997
Proof Animation™ 4.0 is a family of products for animating discrete event simulations. Proof is available in a variety of versions, including an inexpensive, student version, mi...
119
Voted
JACM
2002
15 years 2 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
130
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...