Welcome to the Online Catalogue, 

Central Library

Ramakrishna Mission Vivekananda Educational and Research Institute (RKMVERI), Belur
       
                       Accredited by NAAC with A++  Grade
Amazon cover image
Image from Amazon.com

P, NP, and NP-Completeness: the basics of Computational Complexity

By: Oded GoldreichMaterial type: TextTextLanguage: English Series: Publication details: Cambridge University Press 2010 Edition: Description: xxix, 184pISBN: 9780521122542 (PB)Subject(s): Computational complexity | COMPUTER ALGORITHMS | APPROXIMATION THEORYDDC classification: 005.2 GOL(PNP)
List(s) this item appears in: Title (alphabatically arranged)
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Materials specified Copy number Status Date due Barcode Item holds
Books Books Central Library
005.2 GOL(PNP) (Browse shelf(Opens below)) 1 Available 15544
Total holds: 0

SAR/100/2010/ dt.17-10-2010

There are no comments on this title.

to post a comment.
Visitor count :