We argue that for many problems in this setting, parameterized computational complexity rather than NP-completeness is the appropriate tool for studying ...
確定! 回上一頁