책 이미지

책 정보
· 분류 : 외국도서 > 컴퓨터 > 컴퓨터 공학
· ISBN : 9781489992727
· 쪽수 : 239쪽
· 출판일 : 2014-10-20
목차
The Problem.- G odel's Lost Letter.- Cook's Insight.- Karp Hits Twenty-One.- Nondeterminism.- Why Polynomial Time?.- P=NP and Insider Baseball.- The Knapsack Problem: An Exponential Algorithm.- A Nightmare about P=NP.- The One Page Challenge.- P=NP and Big O Notation.- More Abuse of O-Notation.- Our Problem is More Important Than Your Problem.- The Magic of P 6= NP.- P=NP and the End of Security.- The LBA Problem.- P=NP and The Three Bears.- Bait and Switch: Why Lower Bounds Are So Hard.- The Knapsack Problem: A Lower Bound.- There are Big Circuits Out There.- Knapsack: An Upper Bound.- Hilbert and P=NP.- Are All NP-Complete Problems The Same?.- The Real P=NP Problem.- P=NP in Other Worlds.- P=NP and the Structure of the World.- Do Impossibility Results Matter?.- Circuit Lower Bounds.- The Core of a Problem Who is Afraid of Natural Proofs?.- False Proofs by Famous People.- Cryptography Turned Upside Down Ramsey's Theorem Meets P=NP.- Shooting Down Proofs P=NP.- Where are the Movies?.- P=NP : What are the Odds?.-