- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540414926
3540414924
- Dimensions
-
24 cm
- Extent
-
XV, 196 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Literaturverz. S. 183 - 189
- Bibliographic citation
-
Lecture notes in computer science ; Vol. 1950
- Keyword
-
Berechnungskomplexität
NP-vollständiges Problem
P-vollständiges Problem
Berechnungskomplexität
Randomisierung
- Event
-
Veröffentlichung
- (where)
-
Berlin, Heidelberg, New York, Barcelona, Hong Kong, London, Milan, Paris, Singapore, Tokyo
- (who)
-
Springer
- (when)
-
2000
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:01 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Melkebeek, Dieter van
- Springer
Time of origin
- 2000
Other Objects (12)
Completeness and reduction in algebraic complexity theory
Kolmogorov complexity and computational complexity
Logic and computational complexity : selected papers
The computational complexity of equivalence and isomorphism problems
Graph algorithms and NP-completeness
The computational complexity of logical theories
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Bioinspired computation in combinatorial optimization : algorithms and their computational complexity
Computational complexity
Complexity and approximation, Buch.
Computational complexity of bilinear forms : algebraic coding theory and applications to digital communication systems
Completeness and reduction in algebraic complexity theory
Kolmogorov complexity and computational complexity
Logic and computational complexity : selected papers
The computational complexity of equivalence and isomorphism problems
Graph algorithms and NP-completeness
The computational complexity of logical theories
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Bioinspired computation in combinatorial optimization : algorithms and their computational complexity
Computational complexity
Complexity and approximation, Buch.
Computational complexity of bilinear forms : algebraic coding theory and applications to digital communication systems
Completeness and reduction in algebraic complexity theory
Kolmogorov complexity and computational complexity
Logic and computational complexity : selected papers
The computational complexity of equivalence and isomorphism problems
Graph algorithms and NP-completeness
The computational complexity of logical theories
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Thinking in complexity : the computational dynamics of matter, mind, and mankind
Bioinspired computation in combinatorial optimization : algorithms and their computational complexity
Computational complexity
Complexity and approximation, Buch.