A structured visual guide to the major mathematical areas and their relationships.
Search by code, branch, topic, subtopic, or a keyword from the descriptions.
This subtopic introduces the core ideas in theory of computing, including foundational concepts, standard methods, and the main questions used to organize the area. Typical uses include building mathematical background, framing related research problems, and supporting applications in neighboring fields where these concepts provide useful structure.
This topic examines general topics in theory of computing within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines classical models of computation (turing machines, etc.) within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines models of computation (nondeterministic, parallel, interactive, probabilistic, etc.) within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines networks and circuits as models of computation within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines biologically inspired models of computation within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines other models of computation within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines modes of computation (nondeterministic, parallel, etc.) within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines complexity classes within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines descriptive complexity and finite models within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines analysis of algorithms and problem complexity within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines parameterized complexity and exact algorithms within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines algorithmic information theory (kolmogorov complexity, etc.) within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines computational learning theory within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines grammars and rewriting systems within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines formal languages and automata theory within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines semantics within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines specification and verification (program logics, model checking, etc.) within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines algebraic theory of languages and automata within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines cellular automata within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines models and methods for concurrent and distributed computing within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines probability in computer science within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.
This topic examines none of the above within theory of computing, complexity, and formal models of computation, focusing on the conceptual models, algorithmic structures, and evaluative criteria used in modern research and practice. It provides a practical bridge between formal theory and deployable computational methods.
Theoretical computer science (Wikipedia)
Used to classify problem difficulty, compare computational models, and establish tractability boundaries.