- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540414926
3540414924
- Maße
-
24 cm
- Umfang
-
XV, 196 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Literaturverz. S. 183 - 189
- Erschienen in
-
Lecture notes in computer science ; Vol. 1950
- Schlagwort
-
Berechnungskomplexität
NP-vollständiges Problem
P-vollständiges Problem
Berechnungskomplexität
Randomisierung
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin, Heidelberg, New York, Barcelona, Hong Kong, London, Milan, Paris, Singapore, Tokyo
- (wer)
-
Springer
- (wann)
-
2000
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:01 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Melkebeek, Dieter van
- Springer
Entstanden
- 2000
Ähnliche Objekte (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.