Information-based complexity and operator equations
(1988)
Banach Center Publications
Similarity:
Displaying similar documents to “Descriptive set theoretical complexity of randomness notions”
Information-based complexity and operator equations
Three complexity functions
Sébastien Ferenczi, Pascal Hubert (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.
Towards applying computational complexity to foundations of physics.
Kreinovich, V., Finkelstein, A.M. (2004)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Complexity arguments in algebraic language theory
Helmut Alt, Kurt Mehlhorn (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Relationships among , , and the determinant
Eric Allender, Mitsunori Ogihara (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Three complexity functions
Sébastien Ferenczi, Pascal Hubert (2012)
RAIRO - Theoretical Informatics and Applications
Similarity:
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.
Three complexity functions
Sébastien Ferenczi, Pascal Hubert (2012)
RAIRO - Theoretical Informatics and Applications
Similarity:
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.
Nonuniform complexity classes specified by lower and upper bounds
José L. Balcázar, Joaquim Gabarró (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Preface
ITA (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A survey on real structural complexity theory.
Meer, Klaus, Michaux, Christian (1997)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
A non-deteministic time hierarchy over the reals.
F. Cucker, J. L. Montaña, L. M. Pardo (1993)
Extracta Mathematicae
Similarity:
Immunity and simplicity for exact counting and other counting classes
J. Rothe (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: