233 search results - page 25 / 47 » Interactive Proofs For Quantum Computations |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
SIGCSE
1999
ACM
15 years 4 months ago
1999
ACM
An automata theory course can be taught in an interactive, hands-on manner using a computer. At Duke we have been using the software tool JFLAP to provide interaction and feedback...
ASM
2008
ASM
15 years 1 months ago
2008
ASM
The ingredients of typical model based development via refinement are re-examined, and some well known frameworks are reviewed in that light, drawing out commonalities and differen...
DCC
2010
IEEE
14 years 11 months ago
2010
IEEE
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication ...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...