dogear

enter for all results · esc to close

Moore & Mertens. The Nature of Computation

nature-of-computation.orgsite

It spans complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and of quantum computing. It provides accessible explanations

from
Theoretical Computer Science
added
2026-10-10
likes
0

similar

  1. Demaine. Games, Puzzles, and Computation routledge.com

    It shows that games and puzzles can serve as powerful models of computation, Offering a new way of thinking about computation.

  2. Arora. The Computational Universe cs.princeton.edu

    Takes us on a broad sweep of scientific knowledge and related technologies: propositional logic of the ancient Greeks (microprocessors); quantum mechanics (silicon chips); network and system phenomena (internet and search engines); computational intractability (secure…

  3. Papadimitriou. Computational Complexity pearson.com

    Body of knowledge for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the structural…

  4. Cooper. Computability Theory routledge.com

    A concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results.

  5. Stanford Encyclopedia of Philosophy. Computational Complexity Theory plato.stanford.edu

    The foundations of complexity theory, and its potential significance on philosophy of computer science, philosophy of mathematics and epistemology.

  6. The Introduction To Quantum Computing coursera.org

    A subtle introduction to computation, the math behind it and its quantum counterparts followed by in-depth discussion of a few quantum algorithms.

Theoretical Computer Science › Books: “It spans complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and of quantum computing. It provides accessible explanations”