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

Bibliographic Details
Main Author:	Garey, Michael R.
Other Authors:	Johnson, David S., 1945-
Format:	Book
Language:	English
Published:	New York : Freeman W. H., 1979.
Series:	Series of books in the mathematical sciences
Subjects:	Análisis de algoritmos y problemas de complejidad Teoría de la computación Analysis of algorithms and problem complexity Theory of computation

MARC


LEADER	00000nam a22000007a 4500
001	3573
003	AR_CdUFM
005	20250724133206.0
008	111124s1979 nyu\|\|\|\|\| \|\|\|\| 00\| 0 eng d
020			\|a 0716710455
040			\|a AR_CdUFM \|c AR_CdUFM \|b spa
041			\|a eng
100	1		\|9 5937 \|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			\|a New York : \|b Freeman W. H., \|c 1979.
300			\|a x, 338 páginas : \|b ilustraciones ; \|c 24 cm.
490	0		\|a Series of books in the mathematical sciences
505	0		\|t Computers, complexity, and intractability
505	0		\|t The theory of NP-Completeness
505	0		\|t Proving NP-Completeness results
505	0		\|t Using NP-Completeness to analize problems
505	0		\|t NP-Hardness
505	0		\|t Coping with NP-Complete problems
505	0		\|t Beyond NP-Completeness
650		4	\|a Análisis de algoritmos y problemas de complejidad
650		4	\|a Teoría de la computación
650		4	\|a Analysis of algorithms and problem complexity
650		4	\|a Theory of computation
700	1		\|9 8350 \|a Johnson, David S., \|d 1945-
942			\|c LIBRO \|2 \|n 0
945			\|a MCR \|d 2011-11-24
999			\|c 3573 \|d 3573
952			\|0 0 \|1 0 \|2 CCS \|4 0 \|7 0 \|a MMA \|b MMA \|c 4 \|d 2008-06-09 \|e FAMAF/Comp. \|l 14 \|m 1 \|o C F2 G229 ej.2 \|p 14400 \|r 2023-01-24 00:00:00 \|s 2014-06-11 \|w 2008-06-09 \|y LIBRO
952			\|0 0 \|1 0 \|2 CCS \|4 0 \|7 0 \|a MMA \|b MMA \|c 4 \|d 2008-06-09 \|e FAMAF \|l 6 \|m 1 \|o C F2 G229 \|p 12088 \|r 2025-08-04 10:36:25 \|s 2025-06-23 \|w 2008-06-09 \|y LIBRO