• DML-CZ Home

68Q25 Analysis of algorithms and problem complexity (71 articles)

• Ar, Yilmaz; Emrah Amrahov, Şahin; Gasilov, Nizami A.; Yigit-Sert, Sevgi: A new curve fitting based rating prediction algorithm for recommender systems. (English). Kybernetika, vol. 58 (2022), issue 3, pp. 440-455
• Gadiyar, Gopalakrishna Hejmadi; Padma, Ramanathan: The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives. (English). Czechoslovak Mathematical Journal, vol. 68 (2018), issue 4, pp. 1115-1124
• Dvořáková, Ľubomíra; Dohnalová, Marie: Mince zajímají nejen numismatiky. (Czech) [Coins are of interest not only for numismatists]. Pokroky matematiky, fyziky a astronomie, vol. 62 (2017), issue 2, pp. 110-120
• Li, Xuesong; Ishii, Hiroaki; Chen, Minghao: Batch scheduling problem with due-date and fuzzy precedence relation. (English). Kybernetika, vol. 48 (2012), issue 2, pp. 346-356
• Ge, Yue; Chen, Minghao; Ishii, Hiroaki: Chance constrained bottleneck transportation problem with preference of routes. (English). Kybernetika, vol. 48 (2012), issue 5, pp. 958-967
• Ge, Yue; Ishii, Hiroaki: Stochastic bottleneck transportation problem with flexible supply and demand quantity. (English). Kybernetika, vol. 47 (2011), issue 4, pp. 560-571
• Cechlárová, Katarína: On the complexity of the Shapley-Scarf economy with several types of goods. (English). Kybernetika, vol. 45 (2009), issue 5, pp. 689-700
• Borbeľová, Viera; Cechlárová, Katarína: Pareto optimality in the kidney exchange problem. (English). Kybernetika, vol. 44 (2008), issue 3, pp. 373-384
• Bank, Bernd; Giusti, Marc; Heintz, Joos; Pardo, Luis M.: Generalized polar varieties and an efficient real elimination. (English). Kybernetika, vol. 40 (2004), issue 5, pp. [519]-550
• Allonso, Sira Allende; Guddat, Jürgen; Nowack, Dieter: A modified standard embedding for linear complementarity problems. (English). Kybernetika, vol. 40 (2004), issue 5, pp. [551]-570
• Romaguera, S.; Sánchez-Pérez, E. A.; Valero, O.: Computing complexity distances between algorithms. (English). Kybernetika, vol. 39 (2003), issue 5, pp. [569]-582
• Goeman, Heiko; Clausen, Michael: A new practical linear space algorithm for the longest common subsequence problem. (English). Kybernetika, vol. 38 (2002), issue 1, pp. [45]-66
• Berry, Thomas; Ravindran, Somasundaram: Tuning the Zhu-Takaoka string matching algorithm and experimental results. (English). Kybernetika, vol. 38 (2002), issue 1, pp. [67]-80
• Vaníček, Jiří: Software complexity as a software quality indicator (the three doubts and the light at the end of tunnel). (English). Kybernetika, vol. 33 (1997), issue 3, pp. 333-356
• Gavalec, Martin: Partial order with duality and consistent choice problem. (English). Mathematica Slovaca, vol. 46 (1996), issue 4, pp. 327-342
• Nešetřil, Jaroslav; Rödl, Vojtěch: More on the complexity of cover graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 36 (1995), issue 2, pp. 269-278
• Demel, Jiří; Demlová, Marie: On one NP-complete problem. (English). Kybernetika, vol. 31 (1995), issue 2, pp. 207-211
• Rohn, Jiří: Checking positive definiteness or stability of symmetric interval matrices is NP-hard. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 35 (1994), issue 4, pp. 795-797
• Jansen, Klaus: Exploiting the structure of conflict graphs in high level synthesis. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 35 (1994), issue 1, pp. 155-167
• Kirschenhofer, Peter; Prodinger, Helmut: A coin tossing algorithm for counting large numbers of events. (English). Mathematica Slovaca, vol. 42 (1992), issue 5, pp. 531-545
• Păun, Gheorghe: On the syntactic complexity of parallel communicating grammar systems. (English). Kybernetika, vol. 28 (1992), issue 2, pp. 155-166
• Tuza, Zsolt: Theorem proving through depth-first test. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 33 (1992), issue 2, pp. 135-141
• Hromkovič, Juraj: Branching programs provide lower bounds on the area of VLSI circuits. (English). Kybernetika, vol. 27 (1991), issue 6, pp. 542-550
• Lovász, László: Nový pohled na algoritmickou matematiku. (Czech) [A new approach to algorithmic mathematics]. Pokroky matematiky, fyziky a astronomie, vol. 35 (1990), issue 1, pp. 12-22
• Kratochvíl, Jan; Nešetřil, Jaroslav: INDEPENDENT SET and CLIQUE problems in intersection-defined classes of graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 31 (1990), issue 1, pp. 85-93
• Karp, Richard M.: Kombinatorika, zložitosť a náhodnost. (Slovak) [Combinatorics, complexity and randomness]. Pokroky matematiky, fyziky a astronomie, vol. 34 (1989), issue 6, pp. 313-335
• Kratochvíl, Jan; Matoušek, Jiří: NP-hardness results for intersection graphs. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 4, pp. 761-773
• Ngoc, N. V.: The problems of complexity of almost context-free languages [Abstract of thesis]. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 30 (1989), issue 1, pp. 202
• Wiedermann, Juraj: Medze efektivnosti paralelných výpočtových systémov. (Slovak) [Efficiency limits of parallel computer systems]. Pokroky matematiky, fyziky a astronomie, vol. 33 (1988), issue 2, pp. 81-94
• Pudlák, Pavel: O složitosti. (Czech) [On complexity]. Pokroky matematiky, fyziky a astronomie, vol. 33 (1988), issue 1, pp. 20-34
• Ježek, Jan: An efficient algorithm for computing real powers of a matrix and a related matrix function. (English). Aplikace matematiky, vol. 33 (1988), issue 1, pp. 22-32
• Kramosil, Ivan: Extremum-searching hierarchical parallel probabilistic algorithms. (English). Kybernetika, vol. 24 (1988), issue 2, pp. 110-121
• 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
• Matoušek, Jiří; Nešetřil, Jaroslav; Thomas, Robin: On polynomial time decidability of induced-minor-closed classes. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), issue 4, pp. 703-710
• Cook, Stephen A.: Prehl'ad teórie výpočtovej složitosti. (Slovak) [An overview of computational complexity]. Pokroky matematiky, fyziky a astronomie, vol. 32 (1987), issue 1, pp. 12-29
• Ďuriš, Pavol; Hromkovič, Juraj: Zerotesting bounded one-way multicounter machines. (English). Kybernetika, vol. 23 (1987), issue 1, pp. 13-18
• Hromkovič, Juraj: Hierarchy of reversal bounded one-way multicounter machines. (English). Kybernetika, vol. 22 (1986), issue 2, pp. 200-206
• 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
• Nešetřil, Jaroslav; Poljak, Svatopluk: On the complexity of the subgraph problem. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 26 (1985), issue 2, pp. 415-419
• Kramosil, Ivan; Šindelář, Jan: Infinite pseudo-random sequences of high algorithmic complexity. (English). Kybernetika, vol. 20 (1984), issue 6, pp. 429-437
• Morávek, Jaroslav: On hardly linearly provable systems. (English). Aplikace matematiky, vol. 29 (1984), issue 4, pp. 286-293
• Kárný, Miroslav: Algorithms for determining the model structure of a controlled system. (English). Kybernetika, vol. 19 (1983), issue 2, pp. 164-178
• Kramosil, Ivan: On extremum-searching approximate probabilistic algorithms. (English). Kybernetika, vol. 19 (1983), issue 5, pp. 365-373
• Lawler, Eugene L.: Velký matematický sputnik roku 1979. (Czech) [The great mathematical sputnik of 1979]. Pokroky matematiky, fyziky a astronomie, vol. 27 (1982), issue 1, pp. 39-47
• Demel, Jiří: Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras. (English). Kybernetika, vol. 18 (1982), issue 2, pp. 121-130
• Růžička, Peter: Bounds for on-line selection. (English). Kybernetika, vol. 17 (1981), issue 2, pp. 147-157
• 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
• Žák, Stanislav: A Turing machine oracle hierarchy. II. (English). Commentationes Mathematicae Universitatis Carolinae, vol. 21 (1980), issue 1, pp. 27-39
• 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
• Žák, Stanislav: A Turing machine space hierarchy. (English). Kybernetika, vol. 15 (1979), issue 2, pp. (100)-121
• Peckel, Jan: A deterministic subclass of context-free languages. (English). Časopis pro pěstování matematiky, vol. 103 (1978), issue 1, pp. 43-52
• 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
• Novák, Vilém: An algorithm for reduction of complexity of relations in a system of variables. (English). Aplikace matematiky, vol. 22 (1977), issue 6, pp. 418-424
• Chytil, Michal P.: Crossing-bounded computations and their relation to the LBA-problem. (English). Kybernetika, vol. 12 (1976), issue 2, pp. (76)-85
• Havránek, Tomáš: Statistics and computability. (English). Kybernetika, vol. 12 (1976), issue 5, pp. (303)-315
• 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
• 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
• Nekvinda, Miloslav: On the complexity of events recognizable in real time. (English). Kybernetika, vol. 9 (1973), issue 1, pp. (1)-10
• Č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
• Molnár, Ľudovít: On parameters of an evaluation function for heuristic search as a path problem. (English). Kybernetika, vol. 7 (1971), issue 5, pp. (386)-393
• Fajglová, Ľubica: Určenie koeficienta kompresie pre redukciu dát metódou lineárnej interpolácie. (Slovak) [The determination of the compression coefficient in the reduction of data by the method of linear interpolation]. Kybernetika, vol. 6 (1970), issue 6, pp. (436)-441
• Soukup, Jiří: Non-deterministic behaviour of deterministic computer. (English). Kybernetika, vol. 4 (1968), issue 1, pp. (1)-5
• Bečvář, Jiří: Real-time and complexity problems in automata theory. (English). Kybernetika, vol. 1 (1965), issue 6, pp. (475)-498