Sciweavers

7 search results - page 1 / 2
» stacs 1997
Sort
View
STACS
1997
Springer
13 years 9 months ago
Probabilistic Proof Systems - A Survey
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
Oded Goldreich
STACS
1997
Springer
13 years 9 months ago
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
Abstract. This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the de nitions of ca and of the Block (bca) and Partitioned (pca) s...
Jérôme Olivier Durand-Lose
STACS
1997
Springer
13 years 9 months ago
Strict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
Klaus Reinhardt