Report file quality
duxiu/initial_release/40371597.zip
Computational Complexity Theory (Ias/Park City Mathematics Series) 🔍
Steven Rudich, Avi Wigderson, editors, Steven Rudich and Avi Wigderson, Steven Rudich, Avi Wigderson American Mathematical Society, IAS/Park City Mathematics Institute, 2004, 2004
English [en] · PDF · 97.4MB · 2004 · 📘 Book (non-fiction) · 🚀/duxiu/zlibzh · Save
description
Computational Complexity Theory is the study of how much of a given resource is required to perform the computations that interest us the most. Four decades of fruitful research have produced a rich and subtle theory of the relationship between different resource measures and problems. At the core of the theory are some of the most alluring open problems in mathematics. This book presents three weeks of lectures from the IAS/Park City Mathematics Institute Summer School on computational complexity. The first week gives a general introduction to the field, including descriptions of the basic models, techniques, results and open problems. The second week focuses on lower bounds in concrete models. The final week looks at randomness in computation, with discussions of different notions of pseudorandomness, interactive proof systems and zero knowledge, and probabilistically checkable proofs (PCPs). It is recommended for independent study by graduate students or researchers interested in computational complexity. The volume is recommended for independent study and is suitable for graduate students and researchers interested in computational complexity.
Alternative publisher
American Mathematical Society ; Institute for Advanced Study
Alternative edition
IAS/Park City mathematics series -- v. 10, [Providence, R.I.], New York State, 2004
Alternative edition
IAS/Park City Mathematics Series, Providence (R.I.)], [Princeton (N.J.), ©2004
Alternative edition
American Mathematical Society, [N.p.], 2017
Alternative edition
United States, United States of America
Alternative edition
New Edition, 2004
metadata comments
related_files:
filepath:40371597.zip — md5:8476eb1b27bb5eeb4438cdc594ea8acc — filesize:84288720
filepath:40371597.zip — md5:26981b8c0tdd26f495c9cfabcd93002a — filesize:84288720
filepath:/读秀/读秀4.0/读秀/4.0/数据库21-2/40371597.zip
filepath:第二部分/09-1/40371597.zip
metadata comments
"Volume contains the lecture notes from the Graduate Summer School program on Computational Complexity Theory held in Princeton in the summer of 2000"--T.p. verso
Includes bibliographical references
Alternative description
<p>Computational complexity theory sets the formal mathematical foundations of efficient computation, asking which tasks can be performed given the limitations of computational resources. The field has expanded to include mathematical disciplines, natural and physical sciences, and social sciences such as economics. This volume came from a Park City summer program through the Institute for Advanced Study, and covers its three weeks of lectures. Topics include complexity theory (the discipline from Godel to Feynman, average case complexity, exploring complexity through reductions, and quantum computation), lower bounds (circuit and communication complexity and proof complexity) and randomness in computation (pseudo-randomness and probabilistic proof systems). Presenters include bibliographies with their groups of lectures, but this volume does not include an index. Annotation &copy;2004 Book News, Inc., Portland, OR</p>
Alternative description
"This volume is recommended for independent study and is suitable for graduate students and researchers interested in computational complexity."--BOOK JACKET.
date open sourced
2024-06-13
Read more…
Your ad here.

🚀 Fast downloads

Become a member to support the long-term preservation of books, papers, and more. To show our gratitude for your support, you get fast downloads. ❤️

🐢 Slow downloads

From trusted partners. More information in the FAQ. (might require browser verification — unlimited downloads!)

All download options have the same file, and should be safe to use. That said, always be cautious when downloading files from the internet, especially from sites external to Anna’s Archive. For example, be sure to keep your devices updated.
show external downloads
  • For large files, we recommend using a download manager to prevent interruptions.
    Recommended download managers: JDownloader
  • You will need an ebook or PDF reader to open the file, depending on the file format.
    Recommended ebook readers: Anna’s Archive online viewer, ReadEra, and Calibre
  • Use online tools to convert between formats.
    Recommended conversion tools: CloudConvert and PrintFriendly
  • You can send both PDF and EPUB files to your Kindle or Kobo eReader.
    Recommended tools: Amazon‘s “Send to Kindle” and djazz‘s “Send to Kobo/Kindle”
  • Support authors and libraries
    ✍️ If you like this and can afford it, consider buying the original, or supporting the authors directly.
    📚 If this is available at your local library, consider borrowing it for free there.