• DML-CZ Home

68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (5 articles)

• Chappell, Glenn G.; Gimbel, John: On subgraphs without large components. (English). Mathematica Bohemica, vol. 142 (2017), issue 1, pp. 85-111
• Přikryl, Jan; Vaniš, Miroslav: Comparing numerical integration schemes for a car-following model with real-world data. (English). In: Chleboun, J., Kůs, P., Přikryl, P., Segeth, K., Šístek, J. and Vejchodský, T. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Janov nad Nisou, June 19-24, 2016. Institute of Mathematics CAS, Prague, 2017. pp. 89-96
• 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
• 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
• Bečvář, Jiří: Real-time and complexity problems in automata theory. (English). Kybernetika, vol. 1 (1965), issue 6, pp. (475)-498