P, NP and NP Completeness the basics of computational complexity

other_versions_link
Bibliografski detalji
Glavni autor: Goldreich, Oded
Format: Printed Book
Jezik:English
Izdano: Cambridge Cambridge University Press 2010
Teme:
Computational complexity > computer algorithms > Approximation theory > Polynomials

UL

Detalji primjeraka od UL
Signatura: 519.6 GOL
Primjerak Prikaz statusa u stvarnom vremenu nije dostupan

Similar Items