Welcome to the Online Catalogue, 

Central Library

Ramakrishna Mission Vivekananda Educational and Research Institute (RKMVERI), Belur
       
                       Accredited by NAAC with A++  Grade

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

Oded Goldreich

P, NP, and NP-Completeness: the basics of Computational Complexity - - Cambridge University Press 2010 - xxix, 184p. - .



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

9780521122542 (PB)


Computational complexity
COMPUTER ALGORITHMS
APPROXIMATION THEORY

005.2 GOL(PNP)
Visitor count :