Editing P versus NP problem (section)

==Further reading==
* {{cite book | last = Cormen | first = Thomas|author-link=Thomas Cormen| title = Introduction to Algorithms | publisher = [[MIT Press]] | location = Cambridge | year = 2001 | isbn = 978-0-262-03293-3 | title-link = Introduction to Algorithms }}
* {{Garey-Johnson}}
* {{cite book | last = Goldreich | first = Oded |author-link=Oded Goldreich| title = P, NP, and NP-Completeness | publisher = [[Cambridge University Press]] | location = Cambridge | year = 2010 | isbn = 978-0-521-12254-2 }} [http://www.wisdom.weizmann.ac.il/~oded/bc-drafts.html Online drafts]
* {{Cite journal | last = Immerman | first = Neil |author-link=Neil Immerman| title = Languages that Capture Complexity Classes | pages = 760–778 | year = 1987 | journal=[[SIAM Journal on Computing]]| volume=16 | issue = 4 |doi=10.1137/0216051| citeseerx=10.1.1.75.3035 }}
* {{cite book | last = Papadimitriou | first = Christos | author-link=Christos Papadimitriou|title = Computational Complexity | publisher = [[Addison-Wesley]]| location = Boston | year = 1994 | isbn = 978-0-201-53082-7 }}