13603 search results - page 391 / 2721 » On the Computational Complexity of Cut-Reduction |
163
click to vote
FSTTCS
2004
Springer
16 years 29 days ago
2004
Springer
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
262
click to vote
IWCM
2004
Springer
16 years 29 days ago
2004
Springer
We present a probabilistic framework for component-based automatic detection and tracking of objects in video. We represent objects as spatio-temporal two-layer graphical models, w...
230
click to vote
ICDCS
2002
IEEE
16 years 16 days ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
180
click to vote
CRYPTO
2000
Springer
15 years 12 months ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
181
click to vote
STOC
2007
ACM
16 years 8 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...