• DML-CZ Home

68C25 

• Černý, Anton: Descriptional complexity measures of context-free languages. (English). Kybernetika, vol. 19 (1983), issue 3, pp. 237-247
• Růžička, Peter: Bounds for on-line selection. (English). Kybernetika, vol. 17 (1981), issue 2, pp. 147-157
• Wiedermann, Juraj: The complexity of lexicographic sorting and searching. (English). Aplikace matematiky, vol. 26 (1981), issue 6, pp. 432-436
• Kramosil, Ivan: Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs. (English). Kybernetika, vol. 17 (1981), issue 5, pp. 359-367
• Morávek, Jaroslav: A geometrical method in combinatorial complexity. (English). Aplikace matematiky, vol. 26 (1981), issue 2, pp. 82-96
• Šindelář, Jan: Algorithmical complexity of some statistical decision processes. I. (English). Kybernetika, vol. 16 (1980), issue 4, pp. (345)-356
• Šindelář, Jan: Algorithmical complexity of some statistical decision processes. II. (English). Kybernetika, vol. 16 (1980), issue 4, pp. (357)-376
• Plesník, Ján: On the computational complexity of centers locating in a graph. (English). Aplikace matematiky, vol. 25 (1980), issue 6, pp. 445-452
• Žák, Stanislav: A Turing machine oracle hierarchy. I. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 21 (1980), issue 1, pp. 11-26
• Nekvinda, Miloslav: Memory complexity of countable functions. (English). Kybernetika, vol. 15 (1979), issue 2, pp. (88)-99
• Růžička, Peter; Wiedermann, Juraj: On the conjecture relating minimax and minimean complexity norms. (English). Aplikace matematiky, vol. 24 (1979), issue 5, pp. 321-325
• Růžička, Peter; Wiedermann, Juraj: On the lower bound for minimum comparison selection. (English). Aplikace matematiky, vol. 23 (1978), issue 1, pp. 1-8