P, NP, and np-completeness the basics of computational complexity

By:

Contributor(s):

Material type: Text

TextPublication details: Cambridge Cambridge University Press 2010Description: xxix, 184p. Bibl. IndexISBN:

Subject(s):

DDC classification:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Notes	Date due	Barcode
Book	ISID	518.1 G621.PN (Browse shelf(Opens below))	Available	Ord num:7203; Ord dt:2011-03-30		DP29009

Previous	No cover image available		No cover image available			No cover image available	No cover image available	Next
Previous	518.1 G259.MC Modern computer algebra	518.1 G539.PM Practical mathematical cryptography /	518.1 G621.MC Modern cryptography, probabilistic proofs and pseudo-randomness /	518.1 G621.PN P, NP, and np-completeness	518.1 G741.CM Concrete mathematics : a foundation for computer science /	518.1 G874.IP Inverse problems; activities for undergraduates	518.1 H142.AI Applied iterative methods	Next

There are no comments on this title.

to post a comment.