Overview "Algorithm" (506 entries)

• ➔ Algorithm Class: Asymptotic work ~ O(n)
• ➔ Algorithm Class: Asymptotic work ~ O(n^2)
• ➔ Algorithm Class: Asymptotic work ~ O(n^3) for dense
• ➔ Algorithm class: basic straightedge-and-compass primitives (bisectors, parallels, midpoints, arithmetic with segments)
• ➔ Algorithm Class: Bayesian inference methods
• ➔ Algorithm Class: Comparison-based sorting algorithms (Ω(n log n) lower bound)
• ➔ Algorithm Class: Conjugate-gradient-type eigensolvers (LOBPCG)
• ➔ Algorithm class: construction of regular polygons (constructible n-gons and specific templates such as 5-, 8-, 10-, 12-, 15-, and 17-gons)
• ➔ Algorithm class: constructive Euclidean geometry — the family of straightedge-and-compass and equivalent-constrained construction procedures
• ➔ Algorithm Class: Contour-integral / FEAST-type solvers
• ➔ Algorithm Class: Convex hull and lattice-point enumeration algorithms — master class
• ➔ Algorithm Class: Davidson / Jacobi-Davidson / GD+k methods
• ➔ Algorithm class: decision procedures for classical constructibility (Gauss-Wantzel test, field-extension degree tests)
• ➔ Algorithm Class: Deep-learning and learned iterative methods
• ➔ Algorithm Class: Dense-direct eigensolvers