1888 search results - page 50 / 378 » Proof theory and computational analysis |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
ENTCS
2006
13 years 7 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
MFCS
1998
Springer
13 years 11 months ago
1998
Springer
We develop a control flow analysis for the Imperative Object Calculus. We prove the correctness with respect to two Structural Operational Semantics that differ in minor technical ...
GIAE
2004
Springer
14 years 24 days ago
2004
Springer
This paper surveys the new, algorithmic theory of moving frames developed by the author and M. Fels. Applications in geometry, computer vision, classical invariant theory, the cal...
LLC
2011
13 years 2 months ago
2011
Computational phonology approaches the study of sound patterns in the world’s languages from a computational perspective. This article explains this perspective and its relevanc...