1199 search results - page 142 / 240 » Parameterized Proof Complexity |
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
ANTS
2004
Springer
14 years 2 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
CADE
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex syst...
DIAGRAMS
2000
Springer
14 years 1 months ago
2000
Springer
This paper gives a brief overview of FG, a formal system for doing Euclidean geometry whose basic syntactic elements are geometric diagrams, and which has been implimentented as th...
PKC
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. Thwarting unlawful redistribution of information sold electronically is a major problem of information-based electronic commerce. Anonymous fingerprinting has appeared a...