888 search results - page 15 / 178 » The Power of Temporal Proofs |
72
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and veriļ¬er. The ļ...
SADFE
2008
IEEE
15 years 4 months ago
2008
IEEE
Secure logs are powerful tools for building systems that must resist forgery, prove temporal relationships, and stand up to forensic scrutiny. The proofs of order and integrity en...
105
click to vote
LICS
2010
IEEE
14 years 8 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
180
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we present the ArchIS system that achieves full-functionality transaction-time databases without requiring temporal extensions in XML or database standards. ArchIS&...
SAT
2009
Springer
15 years 4 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they deļ¬ned propositional proof systems as poly-time computable f...