| Record ID | marc_columbia/Columbia-extract-20221130-005.mrc:205660238:1572 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-005.mrc:205660238:1572?format=raw |
LEADER: 01572mam a2200253 a 4500
001 2151678
005 20220615215147.0
008 970919t19951994maua b 001 0 eng d
020 $a0201530821
035 $a(OCoLC)ocm37650219
035 $9ANL4785CU
035 $a2151678
040 $aHVC$cHVC$dOrLoB-B
100 1 $aPapadimitriou, Christos H.$0http://id.loc.gov/authorities/names/n80102786
245 10 $aComputational complexity /$cChristos H. Papadimitriou.
260 $aReading, Mass. :$bAddison-Wesley,$c1995, ©1994.
300 $axv, 523 pages :$billustrations ;$c25 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
500 $a"Reprinted with corrections, August, 1995."--T.p. verso.
504 $aIncludes bibliographical references and indexes.
505 20 $gPt. I.$tAlgorithms.$g1.$tProblems and Algorithms.$g2.$tTuring machines.$g3.$tComputability --$gPt. II.$tLogic.$g4.$tBoolean logic.$g5.$tFirst-order logic.$g6.$tUndecidability in logic --$gPt. III.$tP and NP.$g7.$tRelations between complexity classes.$g8.$tReductions and completeness.$g9.$tNP-complete problems.$g10.$tcoNP and function problems.$g11.$tRandomized computation.$g12.$tCryptography.$g13.$tApproximability.$g14.$tOn P vs. NP --$gPt. IV.$tInside P.$g15.$tParallel computation.$g16.$tLogarithmic space --$gPt. V.$tBeyond NP.$g17.$tThe polynomial hierarchy.$g18.$tComputation that counts.$g19.$tPolynomial space.$g20.$tA glimpse beyond.
650 0 $aComputational complexity.$0http://id.loc.gov/authorities/subjects/sh85029473
852 00 $boff,eng$hQA267.7$i.P36 1995g