Computers and intractability : :: SCD d'Orléans

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

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

Bewaard in:

Bibliografische gegevens
Hoofdauteurs:	Garey, Michael R., Johnson, David S., 1945-2016 (Auteur)
Formaat:	Livre papier
Taal:	Anglais
Gepubliceerd in:	New York, N.Y : W. H. Freeman C 1979.
Reeks:	A series of books in the mathematical sciences / Victor Klee, editor
Onderwerpen:	Ordinateurs Complexité de calcul (informatique) Analyse combinatoire Théorème de complétude
Opmerking:	Autres tirages : 1999, 2000, 2002, 2003, 2008
Autres localisations:	Voir dans le Sudoc
Variante du titre:	NP-completeness

Gelijkaardige items

Completeness Theory for Propositional Logics
door: Pogorzelski, Witold A., 1927-, et al.

Lectures on proof verification and approximation algorithms
door: Mayr, Ernst W., 1950-

Trees in algebra and programming - CAAP '94 : 19th International Colloquium, Edinburgh, U.K., April 11 13, 1994 : proceedings

Logique mathématique
door: Pabion, Jean-François, 1942-
Gepubliceerd in: (1976)

Algorithm theory - SWAT 2000 : 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5 7, 2000 : proceedings

Complexity and structure
door: Schöning, Uwe, 1955-

Bounded : incremental computation
door: Ramalingam, Ganesan, 19..-

Sparsity : graphs, structures, and algorithms
door: Nešetřil, Jaroslav, 1946-...., Mathématicien, et al.

Modified branching programs and their computational power
door: Meinel, Christoph, 1954-...., Professeur

Discrete mathematics and theoretical computer science : 4th international conference, DMTCS 2003, Dijon, France, July 7-12, 2003 : proceedings

Algorithm theory - SWAT '94 : 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6 8, 1994 : proceedings

Algorithm theory - SWAT '96 : 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3 5, 1996 : proceedings

Complete theories
door: Robinson, Abraham, 1918-1974
Gepubliceerd in: (1956)

Cours de logique mathématique. Relation, formule logique, compacité, complétude
door: Fraïssé, Roland, 1920-2008, mathématicien
Gepubliceerd in: (1967)

Mathematical foundations of computer science 1999 : 24th international symposium, MFCS'99 Szklarska Por©eba, Poland, September 6-10, 1999 : proceedings

A Course on Mathematical Logic
door: Srivastava, Sashi Mohan, 19..-

Combinatorial optimization : networks and matroids
door: Lawler, Eugène L., 19..-
Gepubliceerd in: (1976)

Graph-theoretic concepts in computer science : 24th international workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998 : proceedings

Algorithm theory - SWAT '92 : Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8 10, 1992 : proceedings

Fundamentals of computation theory : 8th International Conference, FCT '91 Gosen, Germany, September 9 13, 1991 : proceedings

SWAT 90 : 2nd Scandinavian workshop on algorithm theory, Bergen, Sweden, July 11 14, 1990 : proceedings

Algorithms and complexity : second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994 : proceedings

Algorithms and complexity : third Italian conference, CIAC '97, Rome, Italy, March 12-14, 1997 : proceedings

Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 2000 : proceedings

Combinatorial optimization : algorithms and complexity
door: Papadimitriou, Christos H., 1949-, et al.
Gepubliceerd in: (1982)

Fundamentals of computation theory : International Conference FCT '89 Szeged, Hungary, August 21 25, 1989 : proceedings

Komplexität von Entscheidungsproblemen : ein seminar
door: Specker, Ernst, 1920-2011
Gepubliceerd in: (2005)

Substitutions in dynamics, arithmetics, and combinatorics
door: Pytheas Fogg, N.

Computational science - ICCS 2003 : International conference, Melbourne, Australia and St. Petersburg, Russia, June 2 4, 2003 : proceedings, part IV

Computational science - ICCS 2003 : International conference, Melbourne, Australia and St. Petersburg, Russia, June 2 4, 2003 : proceedings, part III

Computational complexity
door: Papadimitriou, Christos H., 1949-
Gepubliceerd in: (1994)

Efficient checking of polynomials and proofs and the hardness of approximation problems
door: Sudan, Madhu

Randomness and completeness in computational complexity
door: Van Melkebeek, Dieter

Computational science - ICCS 2003 : International conference, Melbourne, Australia and St. Petersburg, Russia, June 2 4, 2003 : proceedings, part I

Computational science - ICCS 2003 : International conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003 : proceedings, part II

Approximation algorithms for combinatorial optimization : 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedings

High performance computing : Proceedings of the International symposium on high performance computing, Montpellier, France, 22-24 March, 1989
Gepubliceerd in: (1989)

Computational science - ICCS 2004 : 4th international conference, Krakow, Poland, June 6-9, 2004 : proceedings, part I

The essence of computation : complexity, analysis, transformation : essays dedicated to Neil D. Jones
door: Mogensen, Torben Æ, 1960-

Computational Science - ICCS 2004 : 4th International Conference, Kraków, Poland, June 6-9, 2004 : proceedings, part II
door: Bubak, Marian, 19..-

© 2021-2023 • Université d'Orléans, Service Commun de Documentation, 6 rue de Tours, 45072 Orléans cedex 2
+33(0) 2 38 41 71 84 • https://scd.univ-orleans.fr • Mentions légales