68-XX |
|
|
Computer science {For papers containing software, source code, etc. in a specific mathematical area, see the classification number –04 in that area} |
|
68Qxx |
|
Theory of computing |
|
|
68Q01 |
General topics in the theory of computing |
|
|
68Q04 |
Classical models of computation (Turing machines, etc.) [See also 03D10] |
|
|
68Q06 |
Networks and circuits as models of computation; circuit complexity [See also 94C11] |
|
|
68Q07 |
Biologically inspired models of computation (DNA computing, membrane computing, etc.) |
|
|
68Q09 |
Other nonclassical models of computation {For quantum computing, see mainly 68Q12, 81P68} |
|
|
68Q10 |
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) [See also 68Q85] |
|
|
68Q11 |
Communication complexity, information complexity |
|
|
68Q12 |
Quantum algorithms and complexity in the theory of computing [See also 68Q09, 81P68] |
|
|
68Q15 |
Complexity classes (hierarchies, relations among complexity classes, etc.) [See also 03D15, 68Q17, 68Q19] |
|
|
68Q17 |
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) [See also 68Q15] |
|
|
68Q19 |
Descriptive complexity and finite models [See also 03C13] |
|
|
68Q25 |
Analysis of algorithms and problem complexity [See also 68W40] |
|
|
68Q27 |
Parameterized complexity, tractability and kernelization |
|
|
68Q30 |
Algorithmic information theory (Kolmogorov complexity, etc.) [See also 03D32] |
|
|
68Q32 |
Computational learning theory [See also 68T05] |
|
|
68Q42 |
Grammars and rewriting systems |
|
|
68Q45 |
Formal languages and automata [See also 03D05, 68Q70, 94A45] |
|
|
68Q55 |
Semantics in the theory of computing [See also 03B70, 06B35, 18C50] |
|
|
68Q60 |
Specification and verification (program logics, model checking, etc.) [See also 03B70] |
|
|
68Q65 |
Abstract data types; algebraic specification [See also 18C50] |
|
|
68Q70 |
Algebraic theory of languages and automata [See also 18B20, 20M35] |
|
|
68Q80 |
Cellular automata (computational aspects) {For cellular automata as dynamical systems, see 37B15} |
|
|
68Q85 |
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |
|
|
68Q87 |
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) [See also 68W20, 68W40] |
|
|
68Q99 |
None of the above, but in this section |