6978 search results - page 158 / 1396 » On Proofs in System P |
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
159
click to vote
JFLP
2002
15 years 6 months ago
2002
We consider prescriptive type systems for logic programs (as in G
158
click to vote
INFORMATICALT
2010
15 years 5 months ago
2010
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veriď...
225
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic systems from proof sketches—compact, formal representations of the essence of a...
176
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...