P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich

Bibliographic Detail #48343

Brief |Full |MARC

Preview Add Tag Add To List Share Suggest Request Save Export Citation

Rate

Material Type

Books

Title	P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich
LC Call #	QA267.7 G65 2010
Author	Goldreich, Oded
Content	Computational tasks and models
	The P versus NP Question
	Polynomial-time reductions
	NP-completeness
	Three relatively advanced topics
Subject	Computer algorithms
	Computation complexity
	Approximation theory
	Polynomials
ISBN	978-0-521-19248-4 (hardback)
	978-0-521-12254-2 (pbk.)
Published/Created	Cambridge, New York : Cambridge University Press, 2010.

Items | Order

Select Branch :

	Barcode	CallNo	Collection	Branch	Location	Status
	33002000032208	QA267.7 G65 2010	Book	PSU Phuket Campus Library	Foreign Book (2nd Fl.)	Available

Library	Ordered Date	Copies	Status
PSU Phuket Campus Library	23 Sep 2013	1	Completely Received

Comment |Review

Add Comment Dialog

Your Name

Comment

Add Review Dialog

Your Name

Content

Add to list

Title

Create in

Use same folder

Create a Folder

Folder Name

Add to list result

Hold Dialog

Branch Receive

Expected Date Received

Request Inprocess Items

เงื่อนไข

ติดต่อสอบถามข้อมูลเพิ่มเติม โทร. 2352

Items Location Map