Stop the war!
Остановите войну!
for scientists:
default search action
Computational Complexity Theory, 2004
- Steven Rudich, Avi Wigderson:
Computational Complexity Theory. IAS / Park City mathematics series 10, AMS Chelsea Publishing 2004, ISBN 978-0-8218-2872-4 - Steven Rudich:
Complexity theory: From Gödel to Feynman. 5-87 - Avi Wigderson:
Average case complexity. 89-99 - Sanjeev Arora:
Exploring complexity through reductions. 101-126 - Ran Raz:
Quantum computation. 127-155 - Ran Raz:
Circuit and Communication Complexity. 159-155 - Paul Beame:
Proof complexity. 199-246 - Oded Goldreich:
Preface to "Week Three: Randomness in Computation". 249-251 - Oded Goldreich:
Pseudorandomness - Part I. 253-285 - Luca Trevisan:
Pseudorandomness - Part II. 287-314 - Salil P. Vadhan:
Probabilistic proof systems - Part I. 315-348 - Madhu Sudan:
Probabilistically checkable proofs. 349-389
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.