Computing Classification System 1998

F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY (B.6-7, F.1.3) ( 0 Dok. )

• F.2.0 General ( 0 Dok. )

• F.2.1 Numerical Algorithms and Problems (G.1, G.4, I.1) ( 0 Dok. )
  • F.2.1 Computation of transforms (e.g., fast Fourier transform)
  • F.2.1 Computations in finite fields
  • F.2.1 Computations on matrices
  • F.2.1 Computations on polynomials
  • F.2.1 Number-theoretic computations (e.g., factoring, primality testing)

• F.2.2 Nonnumerical Algorithms and Problems (E.2-5, G.2, H.2-3) ( 0 Dok. )
  • F.2.2 Complexity of proof procedures
  • F.2.2 Computations on discrete structures
  • F.2.2 Geometrical problems and computations
  • F.2.2 Pattern matching
  • F.2.2 Routing and layout
  • F.2.2 Sequencing and scheduling
  • F.2.2 Sorting and searching

• F.2.3 Tradeoffs between Complexity Measures (F.1.3) ( 0 Dok. )

• F.2.m Miscellaneous ( 0 Dok. )