207 search results - page 6 / 42 » Proof Systems and Transformation Games |
DAGSTUHL
2007
14 years 11 months ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper considers discrete-time periodic linear systems and their Floquet transformations, by which the periodic systems can be equivalently transformed to time-invariant on...
106
click to vote
EUROCRYPT
2012
Springer
13 years 15 hour ago
2012
Springer
sion of an extended abstract published in Proceedings of Eurocrypt 2012, Springer-Verlag, 2012. Available from the IACR Cryptology ePrint Archive as Report 2012/012. Malleability ...
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— This paper derives a novel property of the secondorder modes of discrete-time systems under variable transformation. This is the generalization of the theory presented ...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...