An edition of P Np And Npcompleteness The Basics Of Computational Complexity (2010)

P Np And Npcompleteness The Basics Of Computational Complexity

by

  • 0 Ratings
  • 0 Want to read
  • 1 Currently reading
  • 0 Have read
Cover of: P Np And Npcompleteness The Basics Of Computational Complexity by
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today
Notes
  • 0 Ratings
  • 0 Want to read
  • 1 Currently reading
  • 0 Have read
Notes

Download Options

Check nearby libraries

Buy this book

Last edited by MARC Bot
July 6, 2019 | History
Edit
An edition of P Np And Npcompleteness The Basics Of Computational Complexity (2010)

P Np And Npcompleteness The Basics Of Computational Complexity

by

  • 0 Ratings
  • 0 Want to read
  • 1 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Cambridge University Press

Check nearby libraries

Buy this book

Subjects
Computer algorithms, Computational complexity, Approximation theory, Polynomials

Showing 1 featured edition. View all 1 editions?

Edition Availability
Cover of: P Np And Npcompleteness The Basics Of Computational Complexity
P Np And Npcompleteness The Basics Of Computational Complexity
2010, Cambridge University Press
  • Not in Library
Libraries near you: WorldCat

Add another edition?

Book Details

Classifications

Library of Congress
QA267.7, QA267.7 .G652 2010

ID Numbers

Open Library
OL26123656M
Internet Archive
pnpnpcompletenes00gold
ISBN 13
9780521122542
LCCN
2010023587
OCLC/WorldCat
642204747

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
July 6, 2019 Edited by MARC Bot import existing book
October 14, 2016 Edited by Mek Added new cover
October 14, 2016 Created by Mek Added new book.