| 000 | 01896nam a22004457a 4500 | ||
|---|---|---|---|
| 003 | IIITD | ||
| 005 | 20260106020005.0 | ||
| 008 | 251229b |||||||| |||| 00| 0 eng d | ||
| 020 | _a9780691189130 | ||
| 040 | _aIIITD | ||
| 082 |
_a511.3 _bWIG-M |
||
| 100 | _aWigderson, Avi | ||
| 245 |
_aMathematics and computation : _ba theory revolutionizing technology and science _cby Avi Wigderson |
||
| 260 |
_aNew Jersey : _bPrinceton University Press, _c©2019 |
||
| 300 |
_axiii, 418p. ; _c26 cm. |
||
| 504 | _aInclude bibliographical references. | ||
| 505 | _t1. Introduction | ||
| 505 | _t2. Prelude: Computation, undecidability, and limits to mathematical knowledge | ||
| 505 | _t3. Computational complexity 101: The basics, P, and NP | ||
| 505 | _t4. Problems and classes inside (and around) NP | ||
| 505 | _t5. Lower bounds, Boolean circuits, and attacks on P vs. NP | ||
| 505 | _t6. Proof complexity | ||
| 505 | _t7. Randomness in computation | ||
| 505 | _t8. Abstract pseudo-randomness | ||
| 505 | _t9. Weak random sources and randomness extractors | ||
| 505 | _t10. Randomness and interaction in proofs | ||
| 505 | _t11. Quantum computing | ||
| 505 | _t12. Arithmetic complexity | ||
| 505 | _t13. Interlude: Concrete interactions between math and computational complexity | ||
| 505 | _t14. Space complexity: Modeling limited memory | ||
| 505 | _t15. Communication complexity: Modeling information bottlenecks | ||
| 505 | _t16. On-line algorithms: Coping with an unknown future | ||
| 505 | _t17. Computational learning theory, AI, and beyond | ||
| 505 | _t18. Cryptography: Modeling secrets and lies, knowledge and trust | ||
| 505 | _t19. Distributed computing: Coping with asynchrony | ||
| 505 | _t20. Epilogue: A broader perspective of ToC | ||
| 650 | _aComputational complexity | ||
| 650 | _aComputer science -- Mathematics | ||
| 942 |
_cBK _2ddc _02 |
||
| 999 |
_c209497 _d209497 |
||