Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

polynomial-time approximation scheme · Vinony

EntityQ843550· pop 13· linked from 106 articles

polynomial-time approximation scheme

Sign in to save

complexity class

Connections

computer science

International Standard Book Number

digital object identifier

P versus NP problem

travelling salesperson problem

time complexity

randomized algorithm

approximation algorithm

optimization problem

polylogarithmic function

Angelika Steger

Marek Karpinski

parameterized complexity

Categories

Approximation algorithms Complexity classes

Sources

wikipedia.externallinksexternallink

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

interval arithmetic

Entitydist 0.55

numerical linear algebra

Entitydist 0.55

Laguerre's method

Entitydist 0.56

Lagrange polynomial

Entitydist 0.57

machine epsilon

Entitydist 0.58

Numerical Recipes

Entitydist 0.58

Eikonal approximation

Entitydist 0.62

Graeffe's method

Entitydist 0.62

Richardson extrapolation

Entitydist 0.63

SKI combinator calculus

Entitydist 0.63

Clenshaw algorithm

Entitydist 0.65

James H. Wilkinson Prize in Numerical Analysis and Scientific Computing

Entitydist 0.66

What links here106 pages

knapsack problem

Steiner tree problem

approximation algorithm

planar separator theorem

Epsilon-equilibrium

boolean satisfiability problem

bin packing problem

parameterized complexity

chromatic polynomial

Christofides algorithm

2-satisfiability

travelling salesperson problem

combinatorial optimization

art gallery problem

Joseph S. B. Mitchell