793 search results - page 53 / 159 » Argumentation and standards of proof |
167
click to vote
DM
2011
15 years 1 months ago
2011
We prove that any k-uniform hypergraph on n vertices with minimum degree at least n 2(k−1) + o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K...
168
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...
210
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
178
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a lightweight approach for certification of Java bytecode monitor inlining using proof-carrying code. The main purpose of such a framework is to enable development use ...
170
click to vote
FC
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. This work introduces a new tool for a fund manager to verifiably communicate portfolio risk characteristics to an investor. We address the classic dilemma: How can an in...