Downey & Fellows (1995) defined a hierarchy of parametrized problems, the W hierarchy, that they conjectured did not have fixed-parameter tractable algorithms.
Downey & Fellows (1995) au definit o ierarhie a problemelor parametrizate, ierarhia W, despre care au emis ipoteza că nu are algoritmi tractabili cu parametru fix.