Construct · 1 fields · 1 citations

fixed-parameter tractability: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Parameterized complexity

solvability in time f(k) times a polynomial in input size, so a hard problem becomes efficient when a chosen parameter k stays small.

In parameterized complexity, fixed-parameter tractability refers to solvability in time f(k) times a polynomial in input size, so a hard problem becomes efficient when a chosen parameter k stays small. This meaning comes from Downey (1995) in SIAM Journal on Computing.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how fixed-parameter tractability sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

complexity4 fields · 7 citationsjingle · one word, four constructs parameter3 fields · 3 citationsjingle · one word, three constructs size1 fields · 1 citationsanchor · a standalone construct

References

Downey, R. G., & Fellows, M. R. (1995). Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM Journal on Computing, 24(4), 873-921. https://doi.org/10.1137/s0097539792228228

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct