The Golden Ticket : : P, NP, and the Search for the Impossible /

The Golden Ticket : : P, NP, and the Search for the Impossible / / Lance Fortnow.

Show other versions (1)

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...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013
VerfasserIn:
Fortnow, Lance,
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!
id 9781400846610
ctrlnum (DE-B1597)453875
(OCoLC)828869723
collection bib_alma
record_format marc
spelling Fortnow, Lance, author. aut http://id.loc.gov/vocabulary/relators/aut
The Golden Ticket : P, NP, and the Search for the Impossible / Lance Fortnow.
Course Book
Princeton, NJ : Princeton University Press, [2013]
©2013
1 online resource (192 p.) : 41 halftones. 41 line illus.
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Frontmatter -- Contents -- Preface -- Chapter 1 The Golden Ticket -- Chapter 2 The Beautiful World -- Chapter 3 P and NP -- Chapter 4 The Hardest Problems in NP -- Chapter 5 The Prehistory of P versus NP -- Chapter 6 Dealing with Hardness -- Chapter 7 Proving P ≠ NP -- Chapter 8 Secrets -- Chapter 9 Quantum -- Chapter 10 The Future -- Acknowledgments -- Chapter Notes and Sources -- Index
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
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, its rich history, and its algorithmic implications for everything we do with computers and beyond. Lance Fortnow traces the history and development of P-NP, giving examples from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)
Computer algorithms.
NP-complete problems.
COMPUTERS / Programming / Algorithms. bisacsh
Facebook.
Frenemy.
Hamiltonian paths.
Internet.
Ketan Mulmuley.
Leonid Levin.
Martin Hellman.
NP problem.
NP problems.
NP-complete.
P versus NP problem.
P versus NP.
Richard Feynman.
Steve Cook.
Twitter.
Urbana algorithm.
Whitfield Diffie.
academic work.
algebraic geometry.
algorithm.
algorithms.
approximation.
big data.
computational problems.
computer science.
computers.
computing.
cryptography.
cryptosystem.
database.
decryption.
digital computers.
efficient algorithms.
efficient computation.
encryption.
factoring.
fast computers.
graph isomorphism.
heuristics.
linear programming.
mathematics.
max-cut.
network security.
networking.
new technologies.
parallel computation.
perebor.
prime numbers.
problems.
programming.
public-key cryptography.
quantum computers.
quantum computing.
quantum cryptography.
quantum mechanics.
quantum physical systems.
research community.
secret messages.
social networking data.
solution.
teleportation.
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013 9783110442502
print 9780691156491
https://doi.org/10.1515/9781400846610?locatt=mode:legacy
https://www.degruyter.com/isbn/9781400846610
Cover https://www.degruyter.com/cover/covers/9781400846610.jpg
language English
format eBook
author Fortnow, Lance,
Fortnow, Lance,
spellingShingle Fortnow, Lance,
Fortnow, Lance,
The Golden Ticket : P, NP, and the Search for the Impossible /
Frontmatter --
Contents --
Preface --
Chapter 1 The Golden Ticket --
Chapter 2 The Beautiful World --
Chapter 3 P and NP --
Chapter 4 The Hardest Problems in NP --
Chapter 5 The Prehistory of P versus NP --
Chapter 6 Dealing with Hardness --
Chapter 7 Proving P ≠ NP --
Chapter 8 Secrets --
Chapter 9 Quantum --
Chapter 10 The Future --
Acknowledgments --
Chapter Notes and Sources --
Index
author_facet Fortnow, Lance,
Fortnow, Lance,
author_variant l f lf
l f lf
author_role VerfasserIn
VerfasserIn
author_sort Fortnow, Lance,
title The Golden Ticket : P, NP, and the Search for the Impossible /
title_sub P, NP, and the Search for the Impossible /
title_full The Golden Ticket : P, NP, and the Search for the Impossible / Lance Fortnow.
title_fullStr The Golden Ticket : P, NP, and the Search for the Impossible / Lance Fortnow.
title_full_unstemmed The Golden Ticket : P, NP, and the Search for the Impossible / Lance Fortnow.
title_auth The Golden Ticket : P, NP, and the Search for the Impossible /
title_alt Frontmatter --
Contents --
Preface --
Chapter 1 The Golden Ticket --
Chapter 2 The Beautiful World --
Chapter 3 P and NP --
Chapter 4 The Hardest Problems in NP --
Chapter 5 The Prehistory of P versus NP --
Chapter 6 Dealing with Hardness --
Chapter 7 Proving P ≠ NP --
Chapter 8 Secrets --
Chapter 9 Quantum --
Chapter 10 The Future --
Acknowledgments --
Chapter Notes and Sources --
Index
title_new The Golden Ticket :
title_sort the golden ticket : p, np, and the search for the impossible /
publisher Princeton University Press,
publishDate 2013
physical 1 online resource (192 p.) : 41 halftones. 41 line illus.
Issued also in print.
edition Course Book
contents Frontmatter --
Contents --
Preface --
Chapter 1 The Golden Ticket --
Chapter 2 The Beautiful World --
Chapter 3 P and NP --
Chapter 4 The Hardest Problems in NP --
Chapter 5 The Prehistory of P versus NP --
Chapter 6 Dealing with Hardness --
Chapter 7 Proving P ≠ NP --
Chapter 8 Secrets --
Chapter 9 Quantum --
Chapter 10 The Future --
Acknowledgments --
Chapter Notes and Sources --
Index
isbn 9781400846610
9783110442502
9780691156491
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA267
callnumber-sort QA 3267.7 F67 42018
url https://doi.org/10.1515/9781400846610?locatt=mode:legacy
https://www.degruyter.com/isbn/9781400846610
https://www.degruyter.com/cover/covers/9781400846610.jpg
illustrated Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 511 - General principles of mathematics
dewey-full 511.352
dewey-sort 3511.352
dewey-raw 511.352
dewey-search 511.352
doi_str_mv 10.1515/9781400846610?locatt=mode:legacy
oclc_num 828869723
work_keys_str_mv AT fortnowlance thegoldenticketpnpandthesearchfortheimpossible
AT fortnowlance goldenticketpnpandthesearchfortheimpossible
status_str n
ids_txt_mv (DE-B1597)453875
(OCoLC)828869723
carrierType_str_mv cr
hierarchy_parent_title Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013
is_hierarchy_title The Golden Ticket : P, NP, and the Search for the Impossible /
container_title Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Backlist 2000-2013
_version_ 1806143563951505408
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05835nam a22014535i 4500</leader><controlfield tag="001">9781400846610</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20132013nju fo d z eng d</controlfield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)979970303</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400846610</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400846610</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)453875</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)828869723</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA267.7</subfield><subfield code="b">.F67 2018</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM051300</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">511.352</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fortnow, Lance, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="4"><subfield code="a">The Golden Ticket :</subfield><subfield code="b">P, NP, and the Search for the Impossible /</subfield><subfield code="c">Lance Fortnow.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Course Book</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (192 p.) :</subfield><subfield code="b">41 halftones. 41 line illus.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Chapter 1 The Golden Ticket -- </subfield><subfield code="t">Chapter 2 The Beautiful World -- </subfield><subfield code="t">Chapter 3 P and NP -- </subfield><subfield code="t">Chapter 4 The Hardest Problems in NP -- </subfield><subfield code="t">Chapter 5 The Prehistory of P versus NP -- </subfield><subfield code="t">Chapter 6 Dealing with Hardness -- </subfield><subfield code="t">Chapter 7 Proving P ≠ NP -- </subfield><subfield code="t">Chapter 8 Secrets -- </subfield><subfield code="t">Chapter 9 Quantum -- </subfield><subfield code="t">Chapter 10 The Future -- </subfield><subfield code="t">Acknowledgments -- </subfield><subfield code="t">Chapter Notes and Sources -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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, its rich history, and its algorithmic implications for everything we do with computers and beyond. Lance Fortnow traces the history and development of P-NP, giving examples from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of this compelling problem.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">NP-complete problems.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Programming / Algorithms.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Facebook.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Frenemy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Hamiltonian paths.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Internet.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Ketan Mulmuley.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Leonid Levin.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Martin Hellman.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">NP problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">NP problems.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">NP-complete problems.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">NP-complete.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">P versus NP problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">P versus NP.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Richard Feynman.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Steve Cook.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Twitter.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Urbana algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Whitfield Diffie.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">academic work.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">algebraic geometry.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">algorithm.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">algorithms.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">approximation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">big data.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational problems.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computer science.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computers.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computing.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">cryptography.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">cryptosystem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">database.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">decryption.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">digital computers.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">efficient algorithms.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">efficient computation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">encryption.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">factoring.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">fast computers.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph isomorphism.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">heuristics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">linear programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mathematics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">max-cut.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">network security.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">networking.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">new technologies.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">parallel computation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">perebor.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">prime numbers.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">problems.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">public-key cryptography.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">quantum computers.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">quantum computing.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">quantum cryptography.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">quantum mechanics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">quantum physical systems.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">research community.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">secret messages.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">social networking data.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">solution.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">teleportation.</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="z">9783110442502</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691156491</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400846610?locatt=mode:legacy</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400846610</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9781400846610.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044250-2 Princeton University Press eBook-Package Backlist 2000-2013</subfield><subfield code="c">2000</subfield><subfield code="d">2013</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection>

Similar Items