Skip to content
Toggle navigation
Language
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文(繁體)
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Find
Advanced
Computers and intractability :...
Holdings
Cite this
Text this
Email this
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Computers and intractability :a guide to the theory of NP-completeness /
Main Author:
Garey, Michael R.
Other Authors:
Johnson, David S.
Format:
Book
Language:
English
Published:
San Francisco :
W. H. Freeman ,
c1979 .
Subjects:
Computational complexity
Computer algorithms
Holdings
Description
Similar Items
Staff View
Βιβλιοθήκη
Ταξιθετικός αριθμός
Αριθμός Αντιτύπων
Πληροφορίες
Κατάσταση
ΤΕΙ Αθήνας
-
1
Προβολή
OPAC
Similar Items
Computers and intractability: a guide to the theory of NP-completeness/
by: Garey, Michael R.
Published: (1979)
Computers and intractability a guide to the theory of NP-completeness
by: Garey, Michael R.
Published: (1979)
P, NP, and NP-completeness : the basics of computational complexity /
by: Goldreich, Oded
Published: (2010)
Algorithms from P to NP /
by: Moret, B. M. E.
Published: (1991)
Algorithms and theory of computation handbook : special topics and techniques /
Published: (2009)
×
Loading...