The 1998 ACM Computing Classification System
Toggle navigation
Home
Advanced search
About...
My account
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
Home
Theory of Computation
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
Term
Metadata
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2
Broader Terms
BT
↑
Theory of Computation
More specific terms
NT2
F.2.0 ↓
General
NT2
F.2.1 ↓
Numerical Algorithms and Problems
►
▼
NT3
↓
Computation of transforms
NT3
↓
Computations in finite fields
NT3
↓
Computations on matrices
NT3
↓
Computations on polynomials
NT3
↓
Number-theoretic computations
NT2
F.2.2 ↓
Nonnumerical Algorithms and Problems
►
▼
NT3
↓
Complexity of proof procedures
NT3
↓
Computations on discrete structures
NT3
↓
Geometrical problems and computations
NT3
↓
Pattern matching
NT3
↓
Routing and layout
NT3
↓
Sequencing and scheduling
NT3
↓
Sorting and searching
NT2
F.2.3 ↓
Tradeoffs between Complexity Measures
NT2
F.2.m ↓
Miscellaneous
Related terms
RT
⇆
LOGIC DESIGN
RT
⇆
INTEGRATED CIRCUITS
RT
⇆
Complexity Measures and Classes
Date of creation
30-Dec-2011
Modified
02-Jan-2012
Accepted term
30-Dec-2011
Descendant terms
17
ARK
ark:/99152/t3n14oyked8k5p
More specific terms
5
Alternative terms
0
Related terms
3
Notes
0
Metadata
BS8723-5
DC
MADS
SKOS-Core
VDEX
XTM
Zthes
JSON
JSON-LD
Search