6978 search results - page 291 / 1396 » On Proofs in System P |
151
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
156
click to vote
CRYPTO
2007
Springer
16 years 27 days ago
2007
Springer
In this paper we identify the (P, Q)-DDH assumption, as an extreme, powerful generalization of the Decisional Diffie-Hellman (DDH) assumption: virtually all previously proposed gen...
169
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
164
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
181
click to vote
AMAST
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Formal certification is based on the idea that a mathematical proof of some property of a piece of software can be regarded as a certificate of correctness which, in pr...