The P versus NP Problem

Preprint OPEN
Frank Vega;
(2019)

The $P$ versus $NP$ problem has become in one of the most interesting and crucial questions for many fields such as computer science, mathematics, biology and others. This outstanding problem consists in knowing the answer of the following incognita: Is $P$ equal to $NP... View more
  • References (12)
    12 references, page 1 of 2

    [1] SCOTT AARONSON: PHYS771 Lecture 6: P, NP, and Friends, 2007. 2, 5

    [2] STEPHEN A. COOK: The complexity of theorem proving procedures. In Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (STOC'71), pp. 151-158. ACM Press, 1971. 1

    [3] STEPHEN A. COOK: The P versus NP Problem. Clay Mathematics Institute, 2000. 2, 3

    [4] THOMAS H. CORMEN, CHARLES ERIC LEISERSON, RONALD L. RIVEST, AND CLIFFORD STEIN: Introduction to Algorithms. MIT Press, Second edition, 2001. 2, 3, 4

    [5] LANCE FORTNOW: The Status of the P versus NP Problem. Communications of the ACM, 52(9):78- 86, September 2009. 1

    [6] MICHAEL R. GAREY AND DAVID S. JOHNSON: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, First edition, 1979. 1

    [7] WILLIAM I. GASARCH: The P=?NP poll. SIGACT News, 33(2):34-47, 2002. 2

    [8] ODED GOLDREICH: Foundations of Cryptography, Basic Tools. Cambridge University Press, 2001. 5

    [9] HARRY R. LEWIS AND CHRISTOS H. PAPADIMITRIOU: Elements of the Theory of Computation. Prentice Hall, Second edition, 1998. 1

    [10] CHRISTOS H. PAPADIMITRIOU: Computational Complexity. Addison-Wesley, 1994. 2

  • Metrics
Share - Bookmark