523 search results - page 42 / 105 » On the Power of Quantum Proofs |
81
Voted
FMCAD
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Transformation-based verification has been proposed to synergistically leverage various transformations to successively simplify and decompose large problems to ones whic...
TPHOL
1996
IEEE
15 years 4 months ago
1996
IEEE
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
105
click to vote
RTA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
TCC
2009
Springer
16 years 12 days ago
2009
Springer
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...