MARC 닫기
00000nam c2200205 c 4500
000001119145
20250626153733
ta
120222s1979 us 000a eng
▼a 9780716710455
▼a 211070
▼c 211070
▼d 211070
▼a QA76.6
▼a QA76.6
▼b G35
▼a Computers and Intractability:
▼b A Guide to the Theory of NP-Completeness/
▼d Michael, R. Garey;
▼e David, S. Johnson
▼a San Francisco:
▼b W.H. Freeman,
▼c 1979.
▼a 338p. ;
▼c 24cm
▼a COMPUTERS
▼a INTRACTABILITY
▼a GUIDE
▼a THEORY
▼a NPCOMPLETENESS
▼a Electronic
▼a Digital
▼a Programming
▼a Algeorithms
▼a ComputationalComplexity
▼a R. Garey, Michael
▼a S. Johnson, David
▼b US$71.85
▼a 단행본
| 자료유형 : | 단행본 |
|---|---|
| ISBN : | 9780716710455 |
| 분류기호 : | QA76.6 |
| 서명/저자사항 : | Computers and Intractability: A Guide to the Theory of NP-Completeness/ Michael, R. Garey; David, S. Johnson |
| 발행사항 : | San Francisco: W.H. Freeman, 1979. |
| 형태사항 : | 338p. ; 24cm |
| 개인저자 : | R. Garey, Michael |
| 개인저자 : | S. Johnson, David |
| 언어 | 영어 |
서평쓰기