Mathematics and computation : a theory revolutionizing technology and science /

Bibliographic Details
Main Author: Wigderson, Avi (Author)
Corporate Author: JSTOR (Organization)
Format: eBook
Language:English
Published: Princeton, New Jersey : Princeton University Press, [2019]
Subjects:
Online Access:Connect to the full text of this electronic book

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000cam a22000001i 4500
001 in00004137521
005 20200420141139.0
006 m |o d |
007 cr |n|||||||||
008 191126t20192019njua ob 000 0 eng d
020 |a 9780691192543 (electronic bk.) 
020 |a 0691192545 (electronic bk.) 
020 |z 0691189137 
020 |z 9780691189130 
024 8 |a 40029566948 
035 |a (NhCcYBP)ybp16161198 
040 |a NhCcYBP  |c NhCcYBP  |d UtOrBLW 
050 4 |a QA267.7  |b .W54 2019 
082 0 4 |a 511.3/52  |2 23 
100 1 |a Wigderson, Avi,  |e author.  |0 http://id.loc.gov/authorities/names/n89624795 
245 1 0 |a Mathematics and computation :  |b a theory revolutionizing technology and science /  |c Avi Wigderson. 
264 1 |a Princeton, New Jersey :  |b Princeton University Press,  |c [2019] 
264 4 |c ©2019 
300 |a 1 online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
504 |a Includes bibliographical references (pages 349-418). 
505 0 |a Introduction -- Prelude: computation, undecidability, and limits to mathematical knowledge -- Computational complexity 101: the basics, P, and NP -- Problems and classes inside (and around) NP -- Lower bounds, Boolean circuits, and attacks on P vs NP -- Proof complexity -- Randomness in computation -- Abstract pseudo-randomness -- Weak random sources and randomness extractors -- Randomness and interaction in proofs -- Quantum computing -- Arithmetic complexity -- Interlude: concrete interactions between math and computational complexity -- Space complexity: modeling limited memory -- Communication complexity: modeling information bottlenecks -- On-line algorithms: coping with an unknown future -- Computational learning theory, AI, and beyond -- Cryptography: modeling secrets and lies, knowledge and trust -- Distributed computing: coping with asynchrony -- Epilogue: a broader perspective of ToC. 
588 |a Description based on print version record. 
500 |a Electronic resource. 
650 0 |a Computational complexity.  |0 http://id.loc.gov/authorities/subjects/sh85029473 
650 0 |a Algebra, Boolean.  |0 http://id.loc.gov/authorities/subjects/sh85003429 
650 0 |a Cryptography.  |0 http://id.loc.gov/authorities/subjects/sh85034453 
655 7 |a Electronic books.  |2 local 
710 2 |a JSTOR (Organization)  |0 http://id.loc.gov/authorities/names/no97001983 
776 1 8 |c Original  |z 0691189137  |z 9780691189130 
856 4 0 |u http://proxy.library.tamu.edu/login?url=https://www.jstor.org/stable/10.2307/j.ctvckq7xb  |z Connect to the full text of this electronic book  |t 0 
955 |a YBP purchased approval e-records 
980 |b 70.31  |g 1 
999 f f |s 5f5b8008-c6d4-3437-a879-5e7946f0b559  |i d7f494f1-1d24-3602-8e00-4db02f2e122c  |t 0 
952 f f |a Texas A&M University  |b College Station  |c Electronic Resources  |d Available Online  |t 0  |e QA267.7 .W54 2019  |h Library of Congress classification 
998 f f |a QA267.7 .W54 2019  |t 0  |l Available Online