• DML-CZ Home

03D15 Complexity of computation (15 articles)

• Kimiaei, Morteza; Rostami, Majid: Impulse noise removal based on new hybrid conjugate gradient approach. (English). Kybernetika, vol. 52 (2016), issue 5, pp. 791-823
• Glasnák, Vladimír: Polynomial time bounded truth-table reducibilities to padded sets. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 41 (2000), issue 4, pp. 773-792
• Kramosil, Ivan; Šindelář, Jan: On pseudo-random sequences and their relation to a class of stochastical laws. (English). Kybernetika, vol. 28 (1992), issue 5, pp. 383-391
• Hromkovič, Juraj: Reversals-space-parallelism tradeoffs for language recognition. (English). Mathematica Slovaca, vol. 41 (1991), issue 2, pp. 121-136
• Ďuriš, Pavol: Two new proof techniques for investigating the computational power of two-way computing devices [Abstract of thesis]. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 197-198
• Bebják, Andrej; Štefáneková, Ivana: Nondeterminism is essential for reversal-bounded two-way multihead finite automata. (English). Kybernetika, vol. 24 (1988), issue 1, pp. 65-71
• Křivánek, Mirko: A note on the computational complexity of hierarchical overlapping clustering. (English). Aplikace matematiky, vol. 30 (1985), issue 6, pp. 453-460
• Kramosil, Ivan: On extremum-searching approximate probabilistic algorithms. (English). Kybernetika, vol. 19 (1983), issue 5, pp. 365-373
• Calude, Cristian; Chiţescu, Ion: Representability of recursive P. Martin-Löf tests. (English). Kybernetika, vol. 19 (1983), issue 6, pp. 526-536
• Poljak, Svatopluk; Turzík, Daniel; Pudlák, Pavel: Extensions of $k$-subsets to $k+1$-subsets - existence versus constructability. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), issue 2, pp. 337-349
• Demlová, M.; Demel, Jiří; Koubek, Václav: Simplicity of algebras requires to investigate almost all operations. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 23 (1982), issue 2, pp. 325-335
• 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
• Žá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
• Žák, Stanislav: A Turing machine space hierarchy. (English). Kybernetika, vol. 15 (1979), issue 2, pp. (100)-121