Talk:Parameterized complexity

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Mid‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics Mid This article has been rated as Mid-priority on the project's priority scale. Computer science Mid‑importance This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science Mid This article has been rated as Mid-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

According to dictionary.com it's spelt "Parametrized". Similar to "Oriented" vs "Orientated" I think ...

As you can see in the references, the spelling is correct. ylloh (talk) 14:11, 16 March 2009 (UTC)Reply

If somebody wants to help expanding the section on the W hierarchy, preferably into a separate article, I’d by happy. I find this very difficult to explain, given the number of various attempts at defining these things, all of which are terribly, terribly technical. Thore Husfeldt (talk) 11:34, 17 December 2009 (UTC)Reply

Why do you prefer W(2) over W[2]? Does the second one break something? --Robin (talk) 14:40, 17 December 2009 (UTC)Reply

Exactly. WP:NCTR, so this seemed to be the proper way out. Alternative are welcome. 15:45, 17 December 2009 (UTC) —Preceding unsigned comment added by Thore Husfeldt (talk • contribs)

But those guidelines are for titles of articles. We could still have the section names in this article be W[1] etc. In the far future when W[1] gets its own article, we can let someone else worry about naming the article. --Robin (talk) 15:52, 17 December 2009 (UTC)Reply

I was worried about the square brackets actually messing up the link syntax, more than the title syntax. But if you think it’s green, go ahead and change it back. Thore Husfeldt (talk) 19:01, 17 December 2009 (UTC)Reply

I see your point, but it's really rare that someone would actually want to link to W[2]. And if its really needed, we can use a workaround like W[2]. So I've gone ahead and changed it back to square brackets. --Robin (talk) 19:17, 17 December 2009 (UTC)Reply

I agree that the explanation of the hierarchy needs to be improved, Thore. In particular, I think there shouldn't be a subsection for every single W[t]. ;) ylloh (talk) 10:09, 20 January 2010 (UTC)Reply

In the paragraph about XP, it is said that XP != FPT by a diagonal argument. In the paragraph about Para-NP, it is said that Para-NP = FPT iff P = NP, and that a para-NP hard problem may not belong to XP, unless P = NP.

Should I understand that the diagonal argument works only if P != NP, or more likely, that the latter assertion should be that a para-NP hard problem may not belong to FPT, unless P = NP.

Moreover, It seems clear that k-graph coloring is in XP...

Dorbec (talk) 09:35, 23 January 2023 (UTC)Reply