P, NP, and NP-completeness: the basics of computational complexity
Author
Publisher
Cambridge University Press
Publication Date
Varies, see individual formats and editions
Language
English
Description
Loading Description...
Subjects
Subjects
Algorithms
Approximation theory
Computational complexity
Computer algorithms
COMPUTERS
COMPUTERS -- Programming -- Open Source
COMPUTERS -- Software Development & Engineering -- General
COMPUTERS -- Software Development & Engineering -- Tools
General
Open Source
Polynomials
Programming
Software Development & Engineering
Tools
Approximation theory
Computational complexity
Computer algorithms
COMPUTERS
COMPUTERS -- Programming -- Open Source
COMPUTERS -- Software Development & Engineering -- General
COMPUTERS -- Software Development & Engineering -- Tools
General
Open Source
Polynomials
Programming
Software Development & Engineering
Tools
More Details
ISBN
9780521122542
051190665
9780511906657
9780511761355
9780511907937
9786612797668
9780511909443
9781282797666
051176135
9780511905377
9781139929776
9780511908682
9780521192484
052119248
051190665
9780511906657
9780511761355
9780511907937
9786612797668
9780511909443
9781282797666
051176135
9780511905377
9781139929776
9780511908682
9780521192484
052119248
Staff View
Loading Staff View.
