1888 search results - page 16 / 378 » Proof theory and computational analysis |
CSR
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we classify several algorithmic problems in group theory in the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to ...
FUN
2010
Springer
14 years 3 days ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
JLP
2010
13 years 2 months ago
2010
A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed. It is argued that this formalism provides an elegant way to...
AISC
1998
Springer
13 years 11 months ago
1998
Springer
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...