Everything about Complexity class

🧭 Start here: a 6-step reading path

1. Read the overview: Complexity classA 5-minute orientation
2. Skim a recent paper: Self-bound embedding Class I anisotropic stars by gravitational decoupling within vanishing complexity factor formalismInfluential work since 2022
3. Pick up a classic book: Complex litigationThe most-reprinted book on the subject
4. Read the landmark paper: Genetic Complexity and Expression of Human Class II Histocompatibility AntigensCited 177 times
5. Go sideways: NP (complexity)A closely related topic
6. Go sideways: Computational complexity theoryA closely related topic

🏆 Landmark papers (most cited)

• Genetic Complexity and Expression of Human Class II Histocompatibility Antigens

  A. J. Korman, J. M. Boss, T. Spies · 1985 · Immunological Reviews · 177 citations

• Complexity of strings in the class of Markov sources

  J. Rissanen · 1986 · IEEE Transactions on Information Theory · 132 citations

• Biochemical complexity of serum HLA class I molecules

  Lia M. E. Dobbe, Nico J. Stam, Jacques J. Neefjes · 1988 · Immunogenetics · 98 citations

• Dyn-FO: A Parallel, Dynamic Complexity Class

  Sushant Patnaik, Neil Immerman · 1997 · Journal of Computer and System Sciences · 51 citations

• On the computational complexity of (maximum) class scheduling

  Antoon W.J. Kolen, Leo G. Kroon · 1991 · European Journal of Operational Research · 48 citations

• The complexity of class polynomial computation via floating point approximations

  Andreas Enge · 2008 · Mathematics of Computation · 48 citations

• Parental Reasoning Complexity, Social Class, and Child-Rearing Behaviors

  Maja Dekovic, Jan R. M. Gerris · 1992 · Journal of Marriage and the Family · 24 citations

• THE SALSA CLASS: A COMPLEXITY OF GLOBALIZATION, COSMOPOLITANS AND EMOTIONS

  Jonathan Skinner · 2007 · Identities · 23 citations

🆕 Influential since 2022

• Self-bound embedding Class I anisotropic stars by gravitational decoupling within vanishing complexity factor formalism

  Moza Al Habsi, S. K. Maurya, Sara Al Badri · 2023 · The European Physical Journal C · 37 citations

• Reducing Data Complexity Using Autoencoders With Class-Informed Loss Functions

  David Charte, Francisco Charte, Francisco Herrera · 2022 · IEEE Transactions on Pattern Analysis and Machine Intelligence · 19 citations

• A Class of Low-Complexity DCT-Like Transforms for Image and Video Coding

  Thiago L. T. da Silveira, Diego Ramos Canterle, Diego F. G. Coelho · 2022 · IEEE Transactions on Circuits and Systems for Video Technology · 17 citations

• A new data complexity measure for multi-class imbalanced classification tasks

  Mingming Han, Husheng Guo, Wenjian Wang · 2025 · Pattern Recognition · 16 citations

• EFL students' syntactic complexity development in argumentative writing：A latent class growth analysis (LCGA) approach

  Lawrence Jun Zhang, Jianhua Zhang · 2024 · Assessing Writing · 15 citations

📚 Books worth reading

• Complex litigationRichard L. Marcus · 1985
• Complex organizations and urban communitiesA. M. Shah, B. S. Baviskar · 1996
• Topics in Hardy classes and univalent functionsMarvin Rosenblum, James Rovnyak · 1994
• 📕Mass tort settlement class actionsJay Tidmarsh · 1998
• Class actions and other multi-party litigation in a nutshellRobert H. Klonoff · 1999
• Mass Torts in a World of SettlementRichard A. Nagareda · 2007
• 📕Regulation of MHC Class I gene expression during mouse embryogenesisLeah Jaffe · 1992
• Mass Tort LitigationLinda S. Mullenix · 1996

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• NP (complexity) Unsolved problem in computer science 𝖯 =? 𝖭𝖯 More unsolved problems in computer science In computational complexity theory, NP (nondeterministic polynomial…
• Computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource…
• Probabilistic Turing machine In theoretical computer science, a probabilistic Turing machine is a non-deterministic Turing machine that chooses between the available transitions at…
• NL (complexity) Unsolved problem in computer science ⁠𝖫=?𝖭𝖫⁠ More unsolved problems in computer science In computational complexity theory, NL (Nondeterministic Logarithmic-spa…
• BPP (complexity) In computational complexity theory, a branch of computer science, bounded-error probabilistic polynomial time (BPP) is the class of decision problems solvable…
• Quantum complexity theory Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational…
• NEXPTIME In computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a non-determinis…
• ♯P In computational complexity theory, the complexity class #P (pronounced "sharp P" or, sometimes "number P" or "hash P") is the set of the counting problems…