10715 search results - page 372 / 2143 » Proofs from Tests |
152
click to vote
JAPLL
2006
15 years 6 months ago
2006
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
143
Voted
JMIV
2006
15 years 6 months ago
2006
This paper studies the multi-solution phenomenon for the perspective four point (P4P) problem from geometric and algebraic aspects. We give a pure geometric proof that the P4P pro...
139
click to vote
ENTCS
2007
15 years 6 months ago
2007
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
138
click to vote
MST
2008
15 years 6 months ago
2008
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...
161
click to vote
IJNSEC
2007
15 years 6 months ago
2007
We can view an existing Message Authentication Code (MAC) as a Carter-Wegman MAC in spite of the fact it may not have been designed as one. This will make the analysis easier than...