Algorithm Search⌘K

Definitionadvanced

Subexponential parameterized algorithm

Also called subexponential FPT, SUBEXP.

Runs in 2^(o(k))·poly(n) time, a sharper goal than FPT for some problems such as planar ones.

Runs in 2^(o(k))·poly(n) time, a sharper goal than FPT for some problems such as planar ones.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • one source with a locator

Tag R1A503 Edit this page History Report an error