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

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

Bibliografske podrobnosti
Glavni avtor:	Garey, Michael R.
Drugi avtorji:	Johnson, David S., 1945- (joint author.)
Format:	Knjiga
Jezik:	English
Izdano:	New York ; Houndmills ; San Francisco : W. H. Freeman, c1979.
Serija:	A Series of books in the mathematical sciences
Teme:	Computer programming. Computer algorithms. Computational complexity.
Classic Catalogue:	View this record in Classic Catalogue

Podobne knjige/članki

P, NP, and NP-Completeness
od: Oded Goldreich
Izdano: (2012)

Modern Computer Arithmetic
od: Richard P. Brent, Paul Zimmermann
Izdano: (2012)

Tractability
od: Edited by Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli
Izdano: (2014)

Iterative Methods in Combinatorial Optimization
od: Lap Chi Lau, R. Ravi, Mohit Singh
Izdano: (2012)

Theory of computation /
od: Sipser, Michael
Izdano: (2007)

Modern Computer Algebra
od: Joachim von zur Gathen, Jürgen Gerhard
Izdano: (2013)

Introduction to the theory of computation /
od: Sipser, Michael
Izdano: (1997)

Foundations of algorithms /
od: Neapolitan, Richard E.
Izdano: (2015)

The art of computer programming /
od: Knuth, Donald E., 1938-
Izdano: (1998)

Fundamentals of computer algorithms /
od: Horowitz, Ellis
Izdano: (1997)

The design and analysis of computer algorithms /
od: Aho, Alfred V.
Izdano: (1974)

Computational complexity /
od: Papadimitriou, Christos H.
Izdano: (1994)

Computational complexity /
od: Papadimitriou, Christos H.
Izdano: (1994)

Surveys in Combinatorics 2013
od: Edited by Simon R. Blackburn, Stefanie Gerke, Mark Wildon
Izdano: (2013)

Computational complexity : a modern approach /
od: Arora, Sanjeev
Izdano: (2009)

Introduction to algorithms /
Izdano: (2001)

Elements of programming /
od: Stepanov, Alexander A.
Izdano: (2009)

Algorithms and programming : problems and solutions /
od: Shen, A. (Alexander), 1958-
Izdano: (2008)

Computability and randomness
od: Nies, André

Computer algorithms /
od: Horowitz, Ellis
Izdano: (1998)

Computational complexity : a conceptual perspective /
od: Goldreich, Oded
Izdano: (2008)

The art of computer programming, Volume 4A : Combinatorial algorithms part 1 /
od: Knuth, Donald Ervin, 1938-
Izdano: (2011)

The art of computer programming /
od: Knuth, Donald Ervin, 1938-
Izdano: (1997)

The art of computer programming /
od: Knuth, Donald Ervin, 1938-
Izdano: (2015)

Negotiating intractable conflicts readiness theory revisited /
od: Schiff, Amira
Izdano: (2020)

Negotiating intractable conflicts : readiness theory revisited /
od: Schiff, Amira
Izdano: (2020)

The art of computer programming, Volume 1 : Fundamental algorithms /
od: Knuth, Donald Ervin, 1938-
Izdano: (1997)

The art of computer programming, Volume 2 : Seminumerical algorithms /
od: Knuth, Donald Ervin, 1938-
Izdano: (1998)

The art of computer programming, Volume 3 : Sorting and searching /
od: Knuth, Donald Ervin, 1938-
Izdano: (1998)

Algorithms in C parts 1-5. /
od: Sedgewick, Robert, 1946-
Izdano: (1998)

Algorithms in Java /
od: Sedgewick, Robert, 1946-
Izdano: (2003)

Fundamentals of the theory of computation : principles and practice /
od: Greenlaw, Raymond
Izdano: (1998)

Elements of the theory of computation /
od: Lewis, Harry R.
Izdano: (1998)

The art of computer programming, volume 4, fascicle 5 : mathematical preliminaries redux; introduction to backtracking; dancing links /
od: Knuth, Donald E.
Izdano: (2020)

Computer algorithms : introduction to design and analysis /
od: Baase, Sara
Izdano: (2000)

Automata, computability and complexity : theory and applications /
od: Rich, Elaine
Izdano: (2008)

Improve computational complexity of sobel edge detection using parallel contract anytime algorithm
od: Hossain, Md. Kamal, et al.
Izdano: (2016)

Languages and machines : an introduction to the theory of computer science /
od: Sudkamp, Thomas A.
Izdano: (2006)

Data structures and algorithms in Java /
od: Goodrich, Michael T.
Izdano: (2004)

Data structures and algorithms in C++ /
od: Goodrich, Michael T.
Izdano: (2004)