Theoretical Computer Science
204 items from mostafatouny/awesome-theoretical-computer-science ★1,220
-
Goldreich. P, NP, and NP-Completeness: The Basics of Computational Complexity wisdom.weizmann.ac.il
A very gentle introduction to some fundamental ideas of computational complexity like NP-completeness and P vs NP.
-
Barak. Advice for The Budding Theorist windowsontheory.org
Tips for anyone interested in theoretical computer science.
-
Alon & Spencer. The Probabilistic Method wiley.com
A standard reference for researchers in probabilistic methods in combinatorics. Shows also connections to theoretical computer science.
-
Jukna. Extremal Combinatorics web.vu.lt
Combinatorial techniques written largely with an eye to their applications in TCS, and mostly in complexity
-
Knuth. Things a Computer Scientist Rarely Talks About web.stanford.edu
A general illustration of relations between faith and science.
-
Gregory Valiant. The Modern Algorithmic Toolbox. Stanford web.stanford.edu
It covers hashing, dimension reduction, linear and convex programming, gradient descent and regression, sampling and estimation, compressive sensing, linear-algebraic techniques (principal components analysis, singular value decomposition, spectral techniques), and an intro to…
-
Mary Wootters. Randomized Algorithms and Probabilistic Analysis. Stanford web.stanford.edu
Key tools of probabilistic analysis, and application of these tools to understand the behaviors of random processes and algorithms. Emphasis is on theoretical foundations, though applications will be discussed in machine learning and data analysis, networking, and systems…
-
Intro to Theoretical Computer Science udacity.com
It teaches basic concepts in theoretical computer science, such as NP-completeness, and what they imply for solving tough algorithmic problems.
-
Computability, Complexity & Algorithms. Georgia Institute of Technology udacity.com
It focuses on the big fundamental questions of computing, and how understanding the power and limitations of algorithms helps us develop the tools to make real-world computers smarter, faster and safer.
-
Du & Ko. Design and Analysis of Approximation Algorithms u.pcloud.link
A technique-oriented approach provides a unified view. It includes detailed algorithms, proofs, analyses, examples, and applications from research papers.
-
Vijay Vazirani. Approximation Algorithms u.pcloud.link
-
Tim Roughgarden. Foundations of Blockchains timroughgarden.github.io
The science and technology of blockchain protocols and the applications built on top of them, with an emphasis on fundamental principles rather than specific protocols. - See also Lecture Videos.
-
-
Barak. Surveys For Students thmatters.wordpress.com
Surveys for high-school, undergraduate, and even researchers.
-
Omer Reingold. TOC: a Personal Perspective (2021) theorydish.blog
In celebration of 25 years for “TOC: a Scientific Perspective (1996),” by Oded Goldreich and Avi Wigderson. It spots the light on a criticism directed to TCS, that it is not as deep as Math and not as useful as CS.
-
Theory of Computing Blog Aggregator theory.report
A blog Aggregator for all blogs related to TCS.
-
Arora & Barak. Computational Complexity: A Modern Approach theory.cs.princeton.edu
A golden standard textbook, Surveying computational complexity theory for graduate students and researchers.
-
Terry. Career Advice terrytao.wordpress.com
A collection of various pieces of advice on academic career issues in mathematics, roughly arranged by the stage of career at which the advice is most pertinent.
-
Rosen. Handbook of Discrete and Combinatorial Mathematics taylorfrancis.com
A complete survey of roughly all topics of discrete math and their relevance to computing and communication engineering.
-
Feynman. Feynman And Computation: Exploring The Limits Of Computers taylorfrancis.com
-
Indyk & Daskalakis. Learning-augmented Algorithms. MIT stellar.mit.edu
-
6.893 Philosophy and Theoretical Computer Science. MIT stellar.mit.edu
It examines the relevance of modern theoretical computer science to traditional questions in philosophy, and conversely, what philosophy can contribute to theoretical computer science.
-
Comprehensive Mathematics for Computer Scientists springer.com
A series dedicated to math topics and their relevance to computer science.
-
Jukna. Boolean Function Complexity: Advances and Frontiers springer.com
A modern textbook surveying circuit complexity.
-
Ogihara & Hemaspaandra. The Complexity Theory Companion springer.com
An accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory.
-
Soare. Recursively Enumerable Sets and Degree springer.com
It gives a complete account of the theory of r.e degrees. The definitions, results and proofs are always clearly motivated and explained before the formal presentation; the proofs are described with remarkable clarity and conciseness.
-
Clote & Kranakis. Boolean Functions and Computation Models springer.com
An introduction to circuit complexity, boolean functions, and computation models.
-
Oberguggenberger & Ostermann. Analysis for Computer Scientists: Foundations, Methods, and Algorithms springer.com
Presents an algorithmic approach to mathematical analysis, with a focus on modelling and on the applications of analysis.
-
Floyd & Bokulich. Philosophical Explorations of the Legacy of Alan Turing: Turing 100 springer.com
Turing’s place in the history and philosophy of science.
-
Mariconda & Tonolo. Discrete Calculus: Methods for Counting springer.com
An introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find also deep insights into a range of less common topics rarely considered within a single book.
-
Pudlák. Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction springer.com
Presents a wide range of results in logic and computational complexity.
-
Rosenberg & Trystram. Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students… springer.com
It endows the reader with an operational conceptual and methodological understanding of discrete mathematics for computing
-
Makinson. Sets, Logic and Maths for Computing springer.com
It presents a careful selection of the material most needed by students in their first two years studying computer science.
-
Vince. Foundation Mathematics for Computer Science: A Visual Approach springer.com
A range of mathematical topics to provide a solid foundation for an undergraduate course in computer science, starting with a review of number systems and their relevance to digital computers, and finishing with differential and integral calculus.
-
Yves Nievergelt. Logic, Mathematics, and Computer Science: Modern Foundations with Practical Applications springer.com
For lower undergraduates, It introduces the reader to logic, proofs, sets, and number theory, Focusing on foundations. It provides complete details and derivations of formal proofs.
-
Ben-Ari. Mathematical Logic for Computer Science springer.com
Semantic tableaux are used because they are theoretically sound and easy to understand.
-
Shasha & Lazere. Out of their Minds: The Lives and Discoveries of 15 Great Computer Scientists springer.com
Interviews with era's greatest scientists about their inspirations, discoveries, and personal interests.
-
Gries & Schneider. A Logical Approach to Discrete Math springer.com
It attempts to change the way we teach logic to beginning students. Instead of teaching logic as a subject in isolation, we regard it as a basic tool and show how to use it.
-
UW CSE505 18au Principles of PL sites.google.com
Techniques for thinking crisply about programming languages, write some fascinating programs, and discuss various design tradeoffs.
-
Simons' Institute simons.berkeley.edu
Programs, Events, and workshops, that aim toward maximizing impact and engagement across the theoretical computer science community.
-
ACM's SIGACT sigact.org
-
Part I scottaaronson.com
& Part II - Part I: Presuppose only linear algebra and a bit of classical algorithms. Topics include quantum circuits, density matrices, entanglement entropy, Wiesner’s quantum money, QKD, quantum teleportation, the Bell inequality, interpretations of QM, the Shor 9-qubit code…
-
Aaronson. Why Should Philosophers Care About Computational Complexity Theory scottaaronson.com
It argues that computational complexity theory leads to new perspectives on the nature of mathematical knowledge and other philosophical questions.
-
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.
-
Cooper. Computability Theory routledge.com
A concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results.
-
Atallah & Blanton. Algorithms and Theory of Computation Handbook: Special Topics and Techniques routledge.com
A complete comprehensive encyclopediac handbook which surveys all related areas to theoretical computer science.
-
Atallah & Blanton. Algorithms and Theory of Computation Handbook: General Concepts and Techniques routledge.com
A complete comprehensive encyclopediac handbook which surveys all related areas to theoretical computer science.
-
Lipton & Regan rjlipton.wpcomstaging.com
A list of theory blogs for computer science.
-
Aharonov & Vazirani, Is Quantum Mechanics Falsifiable? A Computational Perspective on the Foundations of Quantum… researchgate.net
It describes how quantum mechanics can be tested in the limit of high complexity regime by extending the usual scientific paradigm to include.
-
Fortnow & Homer. A Short History of Computational Complexity researchgate.net
A historical overview of computational complexity.
- next page of items loading…
