Complexity and structure :: SCD d'Orléans

Complexity and structure

Complexity and structure

Uloženo v:

Podrobná bibliografie
Hlavní autor:	Schöning, Uwe, 1955-
Médium:	Livre numérique
Jazyk:	Anglais
Vydáno:	Berlin [etc.] : Springer [20..]. Cham : Springer Nature
Edice:	Lecture notes in computer science 211
Témata:	Informatique Algorithmes Complexité de calcul (informatique) Analyse combinatoire
On-line přístup:	Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL
Poznámka:	Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale)
Autres localisations:	Voir dans le Sudoc
Edition sous un autre format:	• Complexity and structure, Uwe Schoning, Berlin, Springer-Verlag, 1986, 1 vol. (99 p.), Lecture notes in computer science, 3-540-16079-5 • Complexity and Structure, Texte imprimé, 9783662205440

Podobné jednotky

Algorithms and complexity : 4th Italian conference, CIAC 2000, Rome, Italy, March 2000 : 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

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

Structure in complexity theory : proceedings of the conference held at the University of California, Berkeley, California, June 2-5, 1986

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

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

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

Trees in algebra and programming - CAAP '94 : 19th International Colloquium, Edinburgh, U.K., April 11 13, 1994 : 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

Lectures on the complexity of bilinear problems
Autor: Groote, Hans Friedrich de, 1944-

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

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

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

Sparsity : graphs, structures, and algorithms
Autor: Nešetřil, Jaroslav, 1946-...., Mathématicien, a další

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

Algorithms and complexity : 5th Italian conference, CIAC 2003, Rome, Italy, May 28-30, 2003 : proceedings

Computability and complexity in analysis : 4th international workshop, CCA 2000, Swansea, UK, September 17-19, 2000 : selected papers

Combinatorial optimization : algorithms and complexity
Autor: Papadimitriou, Christos H., 1949-, a další
Vydáno: (1982)

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

Logic and computational complexity : international workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994 : selected papers
Autor: Leivant, Daniel

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

Computers and intractability : A guide to the theory of NP-completeness
Autor: Garey, Michael R., a další
Vydáno: (1979)

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

Combinatorial optimization : networks and matroids
Autor: Lawler, Eugène L., 19..-
Vydáno: (1976)

Computational complexity
Autor: Papadimitriou, Christos H., 1949-
Vydáno: (1994)

Journal of complexity.

The computational complexity of algebraic and numeric problems
Autor: Borodin, Allan, 1941-, a další
Vydáno: (1975)

The computational complexity of equivalence and isomorphism problems
Autor: Thierauf, Thomas

The computational complexity of logical theories
Autor: Ferrante, Jeanne, 1949-, a další

Algorithms and computation : 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings

Le Calcul intensif
Autor: Stockmeyer, Larry, 1948-, a další
Vydáno: (1989)

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

Evolutionary computation in combinatorial optimization : 4th european conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004 : proceedings

Algorithms and computation : 4th International Symposium, ISAAC '93, Hong Kong, December 15 17, 1993 : proceedings

Randomization, approximation, and combinatorial optimization : algorithms and techniques : Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, RANDOM-APPROX 99, Berkeley, CA, USA, August 8-11, 1999 : proceedings

SWAT 88 : 1st Scandinavian workshop on algorithm theory, Halmstad, Sweden, July 5 8, 1988 : proceedings

Computation theory : fifth symposium, Zaborow, Poland, December 3-8, 1984 : proceedings

© 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