Fixed-parameter intractability of optimization problems in NP is studi
ed based on computational models with limited nondeterminism. Strong e
vidence is shown that many NP optimization problems are not fixed-para
meter tractable and that the fixed-parameter intractability hierarchy
(the W-hierarchy) does not collapse. (C) 1995 Academic Press. Inc.