Sciweavers

6978 search results - page 377 / 1396
» On Proofs in System P
Sort
View
SOSP
2003
ACM
16 years 3 months ago
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
Peer-to-peer (P2P) file sharing accounts for an astonishing volume of current Internet traffic. This paper probes deeply into modern P2P file sharing systems and the forces that...
P. Krishna Gummadi, Richard J. Dunn, Stefan Saroiu...
CSL
2007
Springer
16 years 1 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
HASKELL
2005
ACM
16 years 12 days ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
EUROCRYPT
2000
Springer
15 years 10 months ago
Fair Encryption of RSA Keys
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when the...
Guillaume Poupard, Jacques Stern
AAAI
2008
15 years 9 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...