This paper shows how parameterized computational complexity theory is better than previously-used theories of computational complexity , e.g., NP-completeness, at both measuring the power of computational models of cog-nitive systems and isolating the sources of this power. This point is illustrated with new param-eterized analyses of two current constraint… (More)