Loading...
P, NP, and NP-completeness : the basics of computational complexity /
"The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P-versus-NP Question asks whether or not finding solutions is harder than checking the correctness of sol...
| Hovedforfatter: | Goldreich, Oded |
|---|---|
| Format: | Printed Book |
| Sprog: | English |
| Udgivet: |
New York :
Cambridge University Press,
2010.
|
| Fag: | |
| Online adgang: | Cover image |
Lignende værker
-
P, NP and NP Completeness the basics of computational complexity
af: Goldreich, Oded
Udgivet: (2010) -
P, NP, and NP-completeness :The basics of computational complexity
af: Goldreich, Oded
Udgivet: (2010) -
P, NP and NP - completeness - the basics of computational complexity/
af: Goldreich, Oded
Udgivet: (2010) -
N.P.
af: Yoshimoto,Banana
Udgivet: (1990) -
Computational complexity : a modern approach /
af: Arora, Sanjeev
Udgivet: (2009)