Talk:Strong NP-completeness: Difference between revisions

Browse history interactively

Content deleted Content added

VisualWikitext

Inline

Latest revision as of 07:57, 27 February 2024

Computer science High‑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

High

This article has been rated as High-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}}

Mathematics Mid‑priority

	Mathematics portal 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.

Systems Mid‑importance

	Systems science portal This article is within the scope of WikiProject Systems, which collaborates on articles related to systems and systems science.SystemsWikipedia:WikiProject SystemsTemplate:WikiProject SystemsSystems
Mid	This article has been rated as Mid-importance on the project's importance scale.
	This article is within the field of Operations research.

More examples

A list of strongly NP-hard problems would be fine! The article does not even mention only one example. —Preceding unsigned comment added by 92.73.110.246 (talk) 06:22, 16 October 2009 (UTC)[reply]

Merge

I am excited to see if this article will contain anything that can't easily be put into other NP articles. I suggest merge... Medico80 22:45, 7 August 2006 (UTC)[reply]

Haha, umm...a good question. As the one who created it I wouldn't have any problem with merging the information into the NP-completeness article; I just saw some article linking to this (non-existent) page so thought creating it would be a good idea. If the info is put into the NP-completeness article, should we make this one redirect there? Flaxter 02:49, 8 August 2006 (UTC)[reply]

Yes, I think that is the way to do it. Cheers :-) Medico80 19:36, 9 August 2006 (UTC)[reply]

I agree. —Preceding unsigned comment added by 80.229.163.140 (talk) 20:06, 13 October 2007 (UTC)[reply]

strong-NP-hardness not defined correctly

the definition the article gives is:

A problem is said to be strongly NP-hard if a strongly NP-complete problem has a polynomial reduction to it;

This is not correct, right would be:

A problem is said to be strongly NP-hard if any strongly NP problem has a polynomial reduction to it2A02:1205:34D9:C2F0:74E5:7FDB:9D8C:1944 (talk) 12:31, 9 April 2014 (UTC)[reply]

Also, about the same sentence

A problem is said to be strongly NP-hard if a strongly NP-complete problem has a polynomial reduction to it

According to Garey and Johnson 1978, 1979, it seems that the correct sentence would be:

A problem is said to be strongly NP-hard if a strongly NP-complete problem has a pseudo-polynomial reduction to it Bweps (talk) 11:37, 4 June 2015 (UTC)[reply]

@@ Line 1: / Line 1: @@
+{{WikiProject banner shell|class=Start|1=
+{{WikiProject Computer science|importance=high<!-- mid? -->}}
+{{WikiProject Mathematics|importance=mid<!-- low? -->}}
+{{WikiProject Systems|importance=mid<!-- low? -->|field=operations research}}
+}}
+==More examples==
+A list of strongly NP-hard problems would be fine! The article does not
+even mention only one example.  <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/92.73.110.246|92.73.110.246]] ([[User talk:92.73.110.246|talk]]) 06:22, 16 October 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
 ==Merge==
 I am excited to see if this article will contain anything that can't easily be put into other NP articles. I suggest merge... [[User:Medico80|Medico80]] 22:45, 7 August 2006 (UTC)
+:Haha, umm...a good question. As the one who created it I wouldn't have any problem with merging the information into the [[NP-completeness]] article; I just saw some article linking to this (non-existent) page so thought creating it would be a good idea. If the info is put into the [[NP-completeness]] article, should we make this one redirect there? [[User:Flaxter|Flaxter]] 02:49, 8 August 2006 (UTC)
+::Yes, I think that is the way to do it. Cheers :-) [[User:Medico80|Medico80]] 19:36, 9 August 2006 (UTC)
+I agree.  <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/80.229.163.140|80.229.163.140]] ([[User talk:80.229.163.140|talk]]) 20:06, 13 October 2007 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
+==strong-NP-hardness not defined correctly==
+the definition the article gives is:
+: A problem is said to be strongly NP-hard if a strongly NP-complete problem has a polynomial reduction to it;
+This is not correct, right would be:
+: A problem is said to be strongly NP-hard if any strongly NP problem has a polynomial reduction to it[[Special:Contributions/2A02:1205:34D9:C2F0:74E5:7FDB:9D8C:1944|2A02:1205:34D9:C2F0:74E5:7FDB:9D8C:1944]] ([[User talk:2A02:1205:34D9:C2F0:74E5:7FDB:9D8C:1944|talk]]) 12:31, 9 April 2014 (UTC)
+Also, about the same sentence
+: A problem is said to be strongly NP-hard if a strongly NP-complete problem has a polynomial reduction to it
+According to Garey and Johnson 1978, 1979, it seems that the correct sentence would be:
+: A problem is said to be strongly NP-hard if a strongly NP-complete problem has a pseudo-polynomial reduction to it [[User:Bweps|Bweps]] ([[User talk:Bweps|talk]]) 11:37, 4 June 2015 (UTC)