Limiting characterizations of low level space complexity classes
Michèle Angelaccio, Marco Protasi (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the complexity of computable real sequences”
Limiting characterizations of low level space complexity classes
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:
Data types as algorithms
M. A. Nait Abdallah (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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:
Bounded queries to arbitrary sets
A. Lozano (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A note on separating the relativized polynomial time hierarchy by immune sets
Ker-I Ko (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Group theoretical properties and functions
Reinhold Baer (1966)
Colloquium Mathematicae
Similarity:
Special issue dedicated to the thirteenth “Journées Montoises d'Informatique Théorique”
Fabien Durand, Gwénaël Richomme (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: