NP-hardness (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "NP-hardness" in English language version.

refsWebsite

Global rank English rank

5^th place

5^th place

2^nd place

2^nd place

1semanticscholar.org

11^th place

8^th place

1scottaaronson.com

low place

low place

1stackexchange.com

1,983^rd place

1,330^th place

6^th place

6^th place

1books.google.com

3^rd place

3^rd place

archive.org

Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.; Shmoys, D. B. (1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, ISBN 0-471-90413-9.

books.google.com

More precisely, this language is PSPACE-complete; see, for example, Wegener, Ingo (2005), Complexity Theory: Exploring the Limits of Efficient Algorithms, Springer, p. 189, ISBN 9783540210450.

doi.org

Knuth, Donald (1974). "Postscript about NP-hard problems". ACM SIGACT News. 6 (2): 15–16. doi:10.1145/1008304.1008305. S2CID 46480926.

scottaaronson.com

"Shtetl-Optimized » Blog Archive » The Scientific Case for P≠NP". www.scottaaronson.com. Retrieved 2016-09-25.

semanticscholar.org

api.semanticscholar.org

Knuth, Donald (1974). "Postscript about NP-hard problems". ACM SIGACT News. 6 (2): 15–16. doi:10.1145/1008304.1008305. S2CID 46480926.

stackexchange.com

cs.stackexchange.com

"Is undecidable(complement of R) a subset of NP-hard?". Computer Science Stack Exchange. Retrieved 2024-02-09.

worldcat.org

search.worldcat.org

Leeuwen, Jan van, ed. (1998). Handbook of Theoretical Computer Science. Vol. A, Algorithms and complexity. Amsterdam: Elsevier. ISBN 0262720140. OCLC 247934368.