Live briefing
Everything about Computational complexity
Amount of resources to perform an algorithm
In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Computational complexityA 5-minute orientation
- Skim a recent paper: Dynamical memristors for higher-complexity neuromorphic computingInfluential work since 2022
- Pick up a classic book: I, RobotThe most-reprinted book on the subject
- Read the landmark paper: Performance-effective and low-complexity task scheduling for heterogeneous computingCited 3,068 times
- Go sideways: Computational complexity theoryA closely related topic
- Go sideways: Quantum complexity theoryA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Performance-effective and low-complexity task scheduling for heterogeneous computing
Amortized Computational Complexity
Computational complexity of PERT problems
Computational complexity of loss networks
Tutorial on Computational Complexity
Computational complexity in electronic structure
Computational Complexity and the Existence of Complexity Gaps
Computational complexity
🆕 Influential since 2022
Dynamical memristors for higher-complexity neuromorphic computing
Hyperparameter Search for Machine Learning Algorithms for Optimizing the Computational Complexity
Bridging the complexity gap in computational heterogeneous catalysis with machine learning
Computational complexity drives sustained deliberation
Computational Complexity of Puzzles and Related Topics
📚 Books worth reading
I, RobotIsaac Asimov · 1950
Job scheduling strategies for parallel processingJSSPP'99 (1999 San Juan, P.R.), IPPS/SPDP '98 Workshop (1998 Orlando, Fla.) · 1995
Gödel, Escher, BachDouglas R. Hofstadter · 1979
Advances in Swarm IntelligenceYing Tan · 2012
Parallel Processing and Applied MathematicsRoman Wyrzykowski · 2003
Image Analysis and RecognitionAurélio Campilho · 2004
Computational Science and Its Applications - ICCSA 2014Beniamino Murgante, Sanjay Misra · 2014
Thinking in complexityKlaus Mainzer · 1994
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource…
- Quantum complexity theory Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational…
- Time complexity In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- P versus NP problem Unsolved problem in computer science If the solution to a problem can be verified in polynomial time, must the problem be solvable in polynomial time?…
- NP (complexity) Unsolved problem in computer science 𝖯 =? 𝖭𝖯 More unsolved problems in computer science In computational complexity theory, NP (nondeterministic polynomial…
- Random-access Turing machine In computational complexity, a field of theoretical computer science, random-access Turing machines extend the functionality of conventional Turing machines…
- Boolean circuit In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal…