68 Computer science
68Qxx Theory of computing (1 articles)
68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.) (12 articles)
- : Computing complexity distances between algorithms. (English). Kybernetika, vol. 39 (2003), issue 5, pp. [569]-582
- : Polyabelian loops and Boolean completeness. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 41 (2000), issue 4, pp. 671-686
- : Polynomial time bounded truth-table reducibilities to padded sets. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 41 (2000), issue 4, pp. 773-792
- : More on the complexity of cover graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 36 (1995), issue 2, pp. 269-278
- : On one NP-complete problem. (English). Kybernetika, vol. 31 (1995), issue 2, pp. 207-211
- : Computation of rigidity of order $\frac{n^2}r$ for one simple matrix. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 32 (1991), issue 2, pp. 213-218
- : Reversals-space-parallelism tradeoffs for language recognition. (English). Mathematica Slovaca, vol. 41 (1991), issue 2, pp. 121-136
- : Kombinatorika, zložitosť a náhodnost. (Slovak) [Combinatorics, complexity and randomness]. Pokroky matematiky, fyziky a astronomie, vol. 34 (1989), issue 6, pp. 313-335
- : O složitosti. (Czech) [On complexity]. Pokroky matematiky, fyziky a astronomie, vol. 33 (1988), issue 1, pp. 20-34
- : Nondeterminism is essential for reversal-bounded two-way multihead finite automata. (English). Kybernetika, vol. 24 (1988), issue 1, pp. 65-71
- : Hierarchy of reversal bounded one-way multicounter machines. (English). Kybernetika, vol. 22 (1986), issue 2, pp. 200-206
- : Recursive classification of pseudo-random sequences. (English). Kybernetika, vol. 20 (1984), issue 7, pp. (1),3-34
Search
Partner of
