자료유형  

 단행본

International Standard Book Number  

9781400846610 (electronic bk.)

International Standard Book Number  

1400846617 (electronic bk.)

International Standard Book Number  

9780691156491

International Standard Book Number  

0691156492

International Standard Book Number  

9781299156562

International Standard Book Number  

1299156568

Library of Congress Call Number  

QA267.7-.F67 2013eb

Dewey Decimal Classification Number  

511.3/52-23

Main Entry-Personal Name  

Fortnow, Lance , 1963-

Publication, Distribution, etc. (Imprint  

Princeton : Princeton University Press, [2013]

Physical Description  

1 online resource (pages cm)

Bibliography, Etc. Note  

Includes bibliographical references and index.

Formatted Contents Note  

완전내용Cover; Title; Copyright; Dedication; Contents; Chapter 7: Proving P {u2260} NP; 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 8: Secrets; Chapter 9: Quantum; Chapter 10 :The Future; Acknowledgments; Chapter Notes and Sources; Index

Summary, Etc.  

요약"The P-NP problem is the most important open problem in computer science, if not all of mathematics. 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. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem 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. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives.The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem"--해제Provided by publisher.

Subject Added Entry-Topical Term  

NP-complete problems

Subject Added Entry-Topical Term  

Computer algorithms

Subject Added Entry-Topical Term  

COMPUTERS / Programming / Algorithms.

Subject Added Entry-Topical Term  

MATHEMATICS / History & Philosophy.

Subject Added Entry-Topical Term  

MATHEMATICS / Linear Programming.

Subject Added Entry-Topical Term  

MATHEMATICS / Mathematical Analysis.

Subject Added Entry-Topical Term  

COMPUTERS / Machine Theory.

Subject Added Entry-Topical Term  

MATHEMATICS / Linear & Nonlinear Programming.

Additional Physical Form Entry  

Print versionFortnow, Lance, 1963- Golden ticket. Princeton : Princeton University Press, [2013] 9780691156491 (DLC) 2012039523 (OCoLC)820123482

Electronic Location and Access  

로그인을 한후 보실 수 있는 자료입니다.

Control Number  

joongbu:423435