Logo

Educated Owl Books
Help Login / SignUp (0)
Sell with us!
P, NP, and NP-Completeness : The Basics of Computational Complexity

P, NP, and NP-Completeness : The Basics of Computational Complexity

by Oded Goldreich Paperback 2010

⭐ 0.0 rating
⭐ 0.0 out of 5 0 global ratings
5 star
65%
4 star
20%
3 star
10%
2 star
3%
1 star
2%
| 📖 0 saved | ✅ 0 verified
  • Author: Oded Goldreich
  • ISBN 13: 9780521122542
  • ISBN 10: 0521122546
  • Publication Year: 2010
  • Language: English

Specifications

Index-100521122546
LanguageEnglish
Index-139780521122542
Period-
Class Track-
Publisher- (2010)
Pages-

✨ Readers also enjoyed...

View All →
Foundations of Cryptography Vol. 1 : Basic Tools

Foundations of Cryptography Vol. 1…

Oded Goldreich

Inquire 4.666667
Introduction to Property Testing

Introduction to Property Testing

Oded Goldreich

Inquire
Modern Cryptography, Probabilistic Proofs and Pseudorandomness

Modern Cryptography, Probabilistic…

Oded Goldreich, R. L. Graham, B. Korte, László Lovász, A. Wigderson

Inquire
Modern Cryptography, Probabilistic Proofs and Pseudorandomness

Modern Cryptography, Probabilistic…

Oded Goldreich

Inquire
Property Testing : Current Research and Surveys

Property Testing : Current Researc…

Oded Goldreich

Inquire