Metrics for Evaluation of Metaprogram Complexity
Robertas Damaševičius, Vytautas Štuikys (2010)
Computer Science and Information Systems
Similarity:
Displaying similar documents to “Information-based complexity and operator equations”
Metrics for Evaluation of Metaprogram Complexity
Towards applying computational complexity to foundations of physics.
Kreinovich, V., Finkelstein, A.M. (2004)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Several methods of the reduction of computational complexity.
Sharashidze, G. (2004)
Bulletin of TICMI
Similarity:
Descriptive set theoretical complexity of randomness notions
Liang Yu (2011)
Fundamenta Mathematicae
Similarity:
We study the descriptive set theoretical complexity of various randomness notions.
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.
Measuring static complexity.
Goertzel, Ben (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Introduction complexity and industrial systems
Charles S. Tapiero (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A survey on real structural complexity theory.
Meer, Klaus, Michaux, Christian (1997)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
The intrinsic complexity of parametric elimination methods.
Heintz, J., Matera, G., Pardo, L.M., Wachenchauzer, R. (1998)
Electronic Journal of SADIO [electronic only]
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.
On the structure of Valiant's complexity class.
Bürgisser, Peter (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity: