1274 search results - page 144 / 255 » New Proofs for |
147
click to vote
AAAI
1997
15 years 7 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
118
click to vote
AAAI
1990
15 years 7 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
183
Voted
CRYPTO
2010
Springer
15 years 7 months ago
2010
Springer
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
169
click to vote
CIIA
2009
15 years 7 months ago
2009
Because biometrics-based authentication offers several advantages face to other authentication methods, it is important that such systems be designed to withstand attacks. Reliabil...
141
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...