Algorithmic Adventures

DOI10.1007/978-3-540-85986-4MaRDI QIDQ5503636zbMATH OpenOpenAlexFDO

Authors Juraj Hromkovič

Publication date 16 January 2009

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

zbMATH Keywords

algorithmscalculatingcomputer science educationproblem complexity

Mathematics Subject Classification ID

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

Recommendations

• Algorithmics. The spirit of computing
• scientific article; zbMATH DE number 194513
• scientific article; zbMATH DE number 45099
• The nature of computation
• Computational thinking. First algorithms, then code

Cited in

(4)

• The adventures of a simple algorithm
• Once upon an algorithm. How stories explain computing
• Algorithms and Computation
• Infinity and Finite Arithmetic

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)