523 search results - page 41 / 105 » On the Power of Quantum Proofs |
SLP
1993
15 years 1 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
100
click to vote
TIT
2010
14 years 6 months ago
2010
In this paper, we first show that many independent pseudorandom permutations over {0, 1}n can be obtained from a single public random permutation and secret n bits. We next prove ...
117
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
110
click to vote
RTA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
HT
1999
ACM
15 years 4 months ago
1999
ACM
We propose a structure analysis and proof framework for hypertext with conditional linkage. This framework can provide hypertext systems with a powerful and simple tool to help th...