Algorithmic Adventures

DOI10.1007/978-3-540-85986-4zbMATH Open1175.68001OpenAlexW4236850465MaRDI QIDQ5503636

Juraj Hromkovič

Publication date: 16 January 2009

Full work available at URL: https://doi.org/10.1007/978-3-540-85986-4

zbMATH Keywords

algorithmsproblem complexitycomputer science educationcalculating

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Algorithms and Computation ⋮ Infinity and Finite Arithmetic ⋮ The adventures of a simple algorithm

This page was built for publication: Algorithmic Adventures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5503636)