Computers and intractability a guide to the theory of NP-completeness

Saved in:

Bibliographic Details
Main Author:	Garey, Michael R.
Other Authors:	Johnson, David S., 1945-
Format:	Book
Language:	English
Published:	San Francisco W. H. Freeman c1979
Series:	A Series of books in the mathematical sciences
Subjects:	Algorithms Computational complexity Computer programming
Tags:	Add Tag No Tags, Be the first to tag this record!

MARC


LEADER	00000nam a2200000 4500
001	00568163
003	PWmBRO
005	20240602100857.0
008	860616s1979 caua a o0011 eng l
082	0	0	\|a 519.4
090	0	0	\|b 519.4/G229c
100	1	0	\|a Garey, Michael R.
245	1	0	\|a Computers and intractability \|b a guide to the theory of NP-completeness \|c Michael R. Garey, David S. Johnson
260	0	0	\|a San Francisco \|b W. H. Freeman \|c c1979
300	0	0	\|a x, 338 p. \|b ill \|c 24 cm.
490	0	0	\|a A Series of books in the mathematical sciences
595	0	0	\|a 0716710455 \|b pbk.
650	0	0	\|a Algorithms
650	0	0	\|a Computational complexity
650	0	0	\|a Computer programming
700	1	0	\|a Johnson, David S., \|d 1945-
745	0	0	\|a NP-completeness
942			\|2 ddc
994			\|a 001046799 86315 0001
999			\|c 33047 \|d 33047
952			\|0 0 \|1 0 \|4 0 \|7 0 \|8 MN \|a ML015 \|b ML015 \|c MN \|d 2024-06-02 \|l 0 \|o 519.4 G229c \|p 046799 \|r 2018-03-24 00:00:00 \|w 2018-03-24 \|y BK