Find link

language:

Find link is a tool written by Edward Betts.

searching for Quasi-polynomial time 4 found (37 total)

Marc Lackenby (302 words) [view diff] exact match in snippet view article find links to article

2021 he announced a new unknot recognition algorithm that runs in quasi-polynomial time. Lackenby won the Whitehead Prize of the London Mathematical Society

Natural proof (767 words) [view diff] no match in snippet view article find links to article

constructivity condition requires that a property be decidable in (quasi-)polynomial time when the 2n-sized truth table of an n-input boolean function is

Polynomial-time approximation scheme (752 words) [view diff] no match in snippet view article find links to article

not have PTASs. Another deterministic variant of the PTAS is the quasi-polynomial-time approximation scheme or QPTAS. A QPTAS has time complexity npolylog(n)

Knot theory (6,298 words) [view diff] exact match in snippet view article find links to article

Lackenby announced a new unknot recognition algorithm that runs in quasi-polynomial time. A useful way to visualise and manipulate knots is to project the