机读格式显示(MARC)

• 000 01263nam2 2200373 4500

• 000 1000007242

• 001 0000163571

• 003 CAL

• 005 20050125095737.0

• 008 850228c19911979nyua b 001 0 eng d

• 010 __ |z 78012361

• 020 __ |a 0716710455 |c CNY1.90

• 020 __ |a 0716710447

• 040 __ |a XAIT |c XAIT

• 090 __ |a TP31/E52

• 093 __ |a TP31 |2 4

• 099 __ |a CAL 022002002610

• 100 1_ |a Garey, Michael R

• 245 10 |a Computers and intractability : |b a guide to the theory of NP-completeness / |c Michael R. Garey, David S. Johnson

• 260 __ |a New York : |b W.H. Freeman, |c [1991], c1979

• 300 __ |a x, 340 p. : |b ill. ; |c 24 cm

• 490 0_ |a A Series of books in the mathematical sciences

• 500 __ |a "Update for the current printing:" p. [339]-340 (dated "March, 1991")

• 504 __ |a Includes bibliograpical references (p. [291]-325) and indexes

• 650 _0 |a Algorithms

• 650 _0 |a Computational complexity

• 650 _0 |a Computer programming

• 700 10 |a Johnson, David S., |d 1945-

• 740 01 |a NP-completeness

• 905 __ |a XATU |d TP31/E52

• 920 __ |a 261060 |z 1

• 950 __ |a 261060 |f TP31/E52

• 991 __022005003211

• 999 __ |t C |A shenxiaoyan |a 20050125 09:55:52 |M shenxiaoyan |m 20050125 09:57:37 |G shenxiaoyan |g 20050125 09:58:0