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 algorithms and complexity-related methods, 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 algorithms within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines nonnumerical algorithms within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines parallel algorithms in computer science within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines distributed algorithms within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines randomized algorithms, average case analysis within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines approximation algorithms within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines online algorithms; streaming algorithms within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines symbolic computation and algebraic computation within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines algorithms on strings within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines vlsi algorithms within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines analysis of algorithms within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines evolutionary algorithms, genetic algorithms, swarm intelligence within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines graph algorithms and data structures within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.
This topic examines none of the above within algorithms and complexity in computing, focusing on the main concepts, representational choices, and standard questions used in modern research and practice. It provides a concise starting point for understanding how the topic fits into the wider field.
Used to choose, analyze, and improve algorithms for optimization, search, and data processing problems.