The Golden Ticket : : P, NP, and the Search for the Impossible / / Lance Fortnow.
The P-NP problem is the most important open problem in computer science, if not all of mathematics. Simply stated, it asks whether every problem whose solution can be quickly checked by computer can also be quickly solved by computer. The Golden Ticket provides a nontechnical introduction to P-NP, i...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Princeton, NJ : : Princeton University Press, , [2013] ©2013 |
Year of Publication: | 2013 |
Edition: | Course Book |
Language: | English |
Online Access: | |
Physical Description: | 1 online resource (192 p.) :; 41 halftones. 41 line illus. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The golden ticket : P, NP, and the search for the impossible / / Lance Fortnow.
by: Fortnow, Lance,
Published: (2013.) -
Computability : Turing, Godel, Church, and beyond / / edited by B. Jack Copeland, Carl J. Posy, and Oron Shagrir.
Published: (2013.) -
Recent advances in real complexity and computation : : UIMP-RSME Lluis Santalo Summer School 2012, recent advances in real complexity and computation, July 16-20, 2012, UIMP Palacio de la Magdlena, Santander (Cantabria), Spain / / Jose Luis Montana, Luis M. Pardo, editors.
Published: (2013.) -
Logical foundations of mathematics and computational complexity : a gentle introduction / / Pavel Pudlak.
by: Pudlak, Pavel.
Published: (2013.) -
Advances in network complexity / edited by Matthias Dehmer, Abbe Mowshowitz, and Frank Emmert-Streib.
Published: (c2013.)