Category F.2.1 Numerical Algorithms and ProblemsComputation of transforms (e.g., fast Fourier transform)
Computations in finite fields
Computations on matrices
Computations on polynomials
Number-theoretic computations (e.g., factoring, primality testing) Browse in:All Wiki pages Image galleries Images File galleries Blogs Trackers Items Surveys Articles Hide subcategories objects Current category:
Top
::
ITHEA Classification Structure
::
F. Theory of Computation
::
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
::
F.2.1 Numerical Algorithms and Problems
Page: 1/1
1 |
Login World Clock |