1401 search results - page 122 / 281 » Randomness in Interactive Proofs |
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
107
click to vote
ISTCS
1992
Springer
15 years 1 months ago
1992
Springer
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
100
click to vote
ECAI
2004
Springer
15 years 1 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
BMCBI
2006
14 years 10 months ago
2006
Background: Proteins control and mediate many biological activities of cells by interacting with other protein partners. This work presents a statistical model to predict protein ...