P, NP, and NP-Completeness the basics of computational complexity by Oded Goldreich

Goldreich, Oded
Call Number
001.642 G56P
Author
Goldreich, Oded
Title
P, NP, and NP-Completeness the basics of computational complexity by Oded Goldreich
Publication
New Delhi: Cambridg Univrsity Press, 2010.
Physical Description
xxix, 184 p.
Subject
COMPUTATIONAL COMPLEXITY
COMPUTER ALGORITHMS
APPROXIMATION THEORY
POLYNOMIALS
Total Ratings: 0
Location Call Number Barcode Item Class Units Copy Number Status  
IGM Library 001.642 G56P 334365 Books 1 Available
 
 
 
00827nam a2200241   4500
001
 
 
vtls001599444
003
 
 
VRT
005
 
 
20240311100700.0
008
 
 
230208                       00    eng 
020
$a 9780521122542
039
9
$a 202403111007 $b Pad $c 202403051107 $d Madhu $y 202302080914 $z dutt
082
$a 001.642 $b G56P
100
1
$a Goldreich, Oded
245
1
$a P, NP, and NP-Completeness $b the basics of computational complexity $c by Oded Goldreich
260
$a New Delhi: $b Cambridg Univrsity Press, $c 2010.
300
$a xxix, 184 p.
504
$a Includes bibliographical references and index.
650
0
$a COMPUTATIONAL COMPLEXITY
650
0
$a COMPUTER ALGORITHMS
650
0
$a APPROXIMATION THEORY
650
0
$a POLYNOMIALS
999
$a VIRTUA4
999
$a VTLSSORT0080*0200*0820*1000*2450*2600*3000*5040*6500*6501*6502*6503*9992
No Reviews to Display
Subject
COMPUTATIONAL COMPLEXITY
COMPUTER ALGORITHMS
APPROXIMATION THEORY
POLYNOMIALS