1888 search results - page 50 / 378 » Proof theory and computational analysis |
110
Voted
STOC
1993
ACM
15 years 4 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...
89
Voted
ENTCS
2006
15 years 14 days 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,...
108
click to vote
MFCS
1998
Springer
15 years 4 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 ...
141
Voted
GIAE
2004
Springer
15 years 5 months 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...
87
Voted
LLC
2011
14 years 7 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...