523 search results - page 32 / 105 » On the Power of Quantum Proofs |
124
click to vote
CG
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
ACISP
2004
Springer
15 years 7 months ago
2004
Springer
The Canetti-Krawczyk (CK) model is useful for building reusable components that lead to rapid development of secure protocols, especially for engineers working outside of the secur...
123
click to vote
GECCO
1999
Springer
15 years 6 months ago
1999
Springer
Top-down or analytical provers based on the connection tableau calculus are rather powerful, yet have notable shortcomings regarding redundancy control. A well-known and successfu...
122
click to vote
BIRTHDAY
1997
Springer
15 years 6 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
IJCAI
2003
15 years 3 months ago
2003
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...