13383 search results - page 104 / 2677 » Abstractions from proofs |
144
click to vote
CSL
2005
Springer
15 years 10 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
167
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
140
click to vote
JSYML
2010
15 years 3 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
101
click to vote
ASIACRYPT
2000
Springer
15 years 9 months ago
2000
Springer
In a recent Stanford Law Review article, Ayres and Bulow [1] propose a radical anonymity-based solution to disrupt the “market” for monetary influence in political campaigns. ...
143
click to vote
IANDC
2006
15 years 5 months ago
2006
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...