Computability and Complexity Theory

By: Steven HimerContributor(s): Alan L. SelmanMaterial type: Text

TextLanguage: English Publication details: Springer 2011 Edition: 2nd edDescription: xvi, 298pISBN: 9781461406815 (HB)Subject(s): Computational complexityDDC classification: 004.01511352 HOM(COM)

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

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 2 )
Comments ( 0 )

Holdings
Item type	Current library	Call number	Materials specified	Copy number	Status	Date due	Barcode	Item holds
Books	Central Library	004.01511352 HOM(COM) (Browse shelf(Opens below))		1	Available		18110

Total holds: 0

Browsing Central Library shelves Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available					Next
Previous	004.01511352 HAR(FEA) Feasible computations and provable complexity properties	004.01511352 HAR(FEA) Feasible computations and provable complexity properties	004.01511352 HAR(FEA) Feasible computations and provable complexity properties	004.01511352 HOM(COM) Computability and Complexity Theory	004.01511352 JON(COM) Computability and complexity: from a programming perspective	004.01511352 JON(COM) Computability and complexity: from a programming perspective	004.01511352 JUK(BOO) Boolean Function Complexity: advances and frontiers	Next

Bill No.SAR/201/2011 ; dt 13-02-2012

There are no comments on this title.

to post a comment.

Place hold
Print
Suggest for purchase
Send to device
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)