Computational Complexity: A Modern Approach
Sanjeev Arora
Computational complexity theory has developed rapidly in the past three decades. The list of surprising and fundamental results proved since 1990 alone could fill a book: these include new probabilistic definitions of classical complexity classes (IP = PSPACE and the PCP Theorems) and their implications for the field of approximation algorithms; Shor’s algorithm to factor integers using a quantum computer; an understanding of why current approaches to the famous P versus NP will not be successful; a theory of derandomization and pseudorandomness based upon computational hardness; and beautiful constructions of pseudorandom objects such as extractors and expanders.
श्रेणियाँ:
साल:
2006
प्रकाशन:
Princeton University
भाषा:
english
फ़ाइल:
EPUB, 587 KB
IPFS:
,
english, 2006
Amazon 
Barnes & Noble 
Bookshop.org
क्या आप अपना बुक स्टोर जोड़ना चाहेंगे? support@z-lib.fm पर हमसे संपर्क करें
फ़ाइल कन्वर्टर
अधिक खोज परिणाम
अधिक लाभ 
![Sanjeev Arora [Arora, Sanjeev] — Computational Complexity A Modern Approach](https://s3proxy.cdn-zlib.se/covers200/collections/userbooks/72cd1e8850ad3394bf91ebd857c51fd9eb71975dfc44f7676ce0ab569430d004.jpg)
