Live briefing
Everything about Structural complexity theory
Study of complexity classes
In computational complexity theory of computer science, the structural complexity theory or simply structural complexity is the study of complexity classes, rather than computational complexity of individual problems and algorithms. It involves the research of both internal structures of various complexity classes and the relations between different complexity classes. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Structural complexity theoryA 5-minute orientation
- Skim a recent paper: The complexity of ECF investors’ peer-effect: a test of structural social influence theory by fsQCA approachInfluential work since 2022
- Pick up a classic book: Approximation, Randomization, and Combinatorial Optimization. Algorithms and TechniquesThe most-reprinted book on the subject
- Read the landmark paper: Arithmetization: A new method in structural complexity theoryCited 55 times
- Go sideways: Savitch's theoremA closely related topic
- Go sideways: NL (complexity)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Arithmetization: A new method in structural complexity theory
A survey on real structural complexity theory
New developments in structural complexity theory
Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory
On the correlation between discourse frequency and structural complexity in markedness theory
Random matrix theory and complexity in structural acoustics and vibrations
🆕 Influential since 2022
📚 Books worth reading
Approximation, Randomization, and Combinatorial Optimization. Algorithms and TechniquesPrasad Raghavendra, Sofya Raskhodnikova · 2003
Computers and GamesH. Jaap van den Herik, Yngvi Björnsson · 2003
Algebra und Diskrete Mathematik 1Dietlinde Lau · 2004
Graph-Theoretic Concepts in Computer ScienceDieter Kratsch · 2005
Graph-Theoretic Concepts in Computer ScienceAndreas Brandstädt · 2003
Theory and Applications of Models of ComputationManindra Agrawal · 2012
Algorithms on Trees and GraphsGabriel Valiente · 2002
Algebraic probability theoryImre Z. Ruzsa, Gabor J. Szekely · 1988
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Savitch's theorem In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic…
- NL (complexity) Unsolved problem in computer science 𝖫=?𝖭𝖫 More unsolved problems in computer science In computational complexity theory, NL (Nondeterministic Logarithmic-spa…
- Space complexity The space complexity of an algorithm or a data structure is the amount of memory space required to solve an instance of the computational problem as a…
- NSPACE In computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non-deterministic…
- P (complexity) In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can…
- St-connectivity In computer science, st-connectivity or STCON is a decision problem asking, for vertices s and t in a directed graph, if t is reachable from s. Formally…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- Time hierarchy theorem In computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally…