scientific article; zbMATH DE number 870426
From MaRDI portal
Publication:4875855
Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Theory of computing (68Q99)
Cited in
(11)- The algorithmic complexity of minus domination in graphs
- The complexity of domination problems in circle graphs
- Clustering and domination in perfect graphs
- Dynamic self-assembly in living systems as computation
- Real number computation through Gray code embedding.
- The Turing guide. Edited by Jack Copeland, Jonathan Bowen, Mark Sprevak and Robin Wilson
- Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
- Three books on computability, with a special focus on Turing's legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computability from Gödel to Turing; B. J. Copeland (ed.) et al., Computability. Turing, Gödel, church, and beyond; G. Sommaruga and T. Strahm (ed.), Turing's revolution. The impact of his ideas about computability
- Dominating sets in perfect graphs
- Real and integer domination in graphs
- Computer science unplugged and related projects in math and computer science popularization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875855)
