• DML-CZ Home

68A20 

• Žák, Stanislav: A Turing machine oracle hierarchy. I. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 21 (1980), issue 1, pp. 11-26
• Žák, Stanislav: A Turing machine oracle hierarchy. II. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 21 (1980), issue 1, pp. 27-39
• Havránek, Tomáš: Statistics and computability. (English). Kybernetika, vol. 12 (1976), issue 5, pp. (303)-315
• Gruska, Jozef: A note on $\varepsilon$-rules in context-free grammars. (English). Kybernetika, vol. 11 (1975), issue 1, pp. (26)-31
• Pudlák, Pavel: The observational predicate calculus and complexity of computations (Preliminary communication). (English). Commentationes Mathematicae Universitatis Carolinae, vol. 16 (1975), issue 2, pp. 395-398
• Poljak, Svatopluk: A note on stable sets and colorings of graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 15 (1974), issue 2, pp. 307-309
• Chytil, Michal P.: On changes of input/output coding. II. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 15 (1974), issue 1, pp. 1-17
• Chytil, Michal P.: On changes of input/output coding. I. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 14 (1973), issue 4, pp. 623-645
• Čulík, Karel: Algorithmization of algebras and relational structures. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 13 (1972), issue 3, pp. 457-477
• Morávek, Jaroslav: A localization problem in geometry and complexity of discrete programming. (English). Kybernetika, vol. 8 (1972), issue 6, pp. (498)-516
• Čulík, Karel: Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers. (English). Aplikace matematiky, vol. 16 (1971), issue 3, pp. 188-202
• Čulík, Karel: A note on complexity of algorithmic nets without cycles. (English). Aplikace matematiky, vol. 16 (1971), issue 4, pp. 297-301