Totalmente NP-completo (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Totalmente NP-completo" in Spanish language version.

refsWebsite

Global rank Spanish rank

451^st place

1,294^th place

6^th place

5^th place

1,185^th place

1,347^th place

57^th place

3^rd place

2^nd place

2^nd place

acm.org

doi.acm.org

Garey, M. R.; Johnson, D. S. (julio de 1978). 'Strong' NP-Completeness Results: Motivation, Examples, and Implications 25 (3). New York, NY: ACM. pp. 499-508. ISSN 0004-5411. MR 478747. doi:10.1145/322077.322090.

ams.org

Garey, M. R.; Johnson, D. S. (julio de 1978). 'Strong' NP-Completeness Results: Motivation, Examples, and Implications 25 (3). New York, NY: ACM. pp. 499-508. ISSN 0004-5411. MR 478747. doi:10.1145/322077.322090.
Vazirani, Vijay V. (2003). Approximation Algorithms. Berlin: Springer. pp. 294–295. ISBN 3-540-65367-8. MR 1851303.
Garey, M. R.; Johnson, D. S. (1979). Victor Klee, ed. Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences. San Francisco, Calif.: W. H. Freeman and Co. pp. x+338. ISBN 0-7167-1045-5. MR 519066.

archive.org

Vazirani, Vijay V. (2003). Approximation Algorithms. Berlin: Springer. pp. 294–295. ISBN 3-540-65367-8. MR 1851303.
Garey, M. R.; Johnson, D. S. (1979). Victor Klee, ed. Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences. San Francisco, Calif.: W. H. Freeman and Co. pp. x+338. ISBN 0-7167-1045-5. MR 519066.

doi.org

dx.doi.org

Garey, M. R.; Johnson, D. S. (julio de 1978). 'Strong' NP-Completeness Results: Motivation, Examples, and Implications 25 (3). New York, NY: ACM. pp. 499-508. ISSN 0004-5411. MR 478747. doi:10.1145/322077.322090.

issn.org

portal.issn.org

Garey, M. R.; Johnson, D. S. (julio de 1978). 'Strong' NP-Completeness Results: Motivation, Examples, and Implications 25 (3). New York, NY: ACM. pp. 499-508. ISSN 0004-5411. MR 478747. doi:10.1145/322077.322090.