Amazon cover image
Image from Amazon.com

Mathematics and computation : a theory revolutionizing technology and science

By: Material type: TextTextPublication details: New Jersey : Princeton University Press, ©2019Description: xiii, 418p. ; 26 cmISBN:
  • 9780691189130
Subject(s): DDC classification:
  • 511.3 WIG-M
Contents:
1. Introduction
2. Prelude: Computation, undecidability, and limits to mathematical knowledge
3. Computational complexity 101: The basics, P, and NP
4. Problems and classes inside (and around) NP
5. Lower bounds, Boolean circuits, and attacks on P vs. NP
6. Proof complexity
7. Randomness in computation
8. Abstract pseudo-randomness
9. Weak random sources and randomness extractors
10. Randomness and interaction in proofs
11. Quantum computing
12. Arithmetic complexity
13. Interlude: Concrete interactions between math and computational complexity
14. Space complexity: Modeling limited memory
15. Communication complexity: Modeling information bottlenecks
16. On-line algorithms: Coping with an unknown future
17. Computational learning theory, AI, and beyond
18. Cryptography: Modeling secrets and lies, knowledge and trust
19. Distributed computing: Coping with asynchrony
20. Epilogue: A broader perspective of ToC
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds Course reserves
Reference Reference IIITD Reference Mathematics REF 511.3 WIG-M (Browse shelf(Opens below)) Checked out Not for loan 04/02/2026 013673

Complexity Theory WNT26

Total holds: 0

Include bibliographical references.

1. Introduction

2. Prelude: Computation, undecidability, and limits to mathematical knowledge

3. Computational complexity 101: The basics, P, and NP

4. Problems and classes inside (and around) NP

5. Lower bounds, Boolean circuits, and attacks on P vs. NP

6. Proof complexity

7. Randomness in computation

8. Abstract pseudo-randomness

9. Weak random sources and randomness extractors

10. Randomness and interaction in proofs

11. Quantum computing

12. Arithmetic complexity

13. Interlude: Concrete interactions between math and computational complexity

14. Space complexity: Modeling limited memory

15. Communication complexity: Modeling information bottlenecks

16. On-line algorithms: Coping with an unknown future

17. Computational learning theory, AI, and beyond

18. Cryptography: Modeling secrets and lies, knowledge and trust

19. Distributed computing: Coping with asynchrony

20. Epilogue: A broader perspective of ToC

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in