On effective speed-up and long proofs of trivial theorems in formal theories
J. Hartmanis (1976)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Fractal geometry, Turing machines and divide-and-conquer recurrences”
On effective speed-up and long proofs of trivial theorems in formal theories
Undecidable event detection problems for ODEs of dimension one and two
Keijo Ruohonen (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A fast algorithm to decide on the equivalence of stateless DPDA
Didier Caucal (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The theory of invertible algorithms
Gianni Aguzzi (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Monotonous and randomized reductions to sparse sets
V. Arvind, J. Köbler, M. Mundhenk (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On schemata and systems for parallel algorithms
Georg Gati (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On geometric automata which can nondeterministically choose auxiliary points
Ulrich Huckenbeck (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: