- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540674498
3540674497
- Maße
-
24 cm
- Umfang
-
IX, 254 S.
- Sprache
-
Englisch
- Anmerkungen
-
Literaturverz. S. 227 - 244
- Erschienen in
-
Lecture notes in mathematics ; 1733
- Schlagwort
-
Stochastischer Prozess
Numerische Mathematik
Average-case-Komplexität
- 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.03.2025, 12:22 MEZ
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
- Ritter, Klaus
- Springer
Entstanden
- 2000
Ähnliche Objekte (12)
Towards average case complexity analysis of NP optimization problems
Average case approximability of optimisation problems
Average case analysis of algorithms : 03.07. - 07.07.95
Average-case complexity of shortest-paths problems
Average-case complexity of shortest-paths problems
Average case competitive analyses for ski rental problems
Structural average case complexity
From worst-case to average-case efficiency : approximating combinatorial optimization problems
k-shortest path: average-case analysis and practical improvements
Fundamentals of the average case analysis of particular algorithms
Average-case intractability vs. worst-case intractability
Average case considerations for Mergelnsertion
Towards average case complexity analysis of NP optimization problems
Average case approximability of optimisation problems
Average case analysis of algorithms : 03.07. - 07.07.95
Average-case complexity of shortest-paths problems
Average-case complexity of shortest-paths problems
Average case competitive analyses for ski rental problems
Structural average case complexity
From worst-case to average-case efficiency : approximating combinatorial optimization problems
k-shortest path: average-case analysis and practical improvements
Fundamentals of the average case analysis of particular algorithms
Average-case intractability vs. worst-case intractability
Average case considerations for Mergelnsertion
Towards average case complexity analysis of NP optimization problems
Average case approximability of optimisation problems
Average case analysis of algorithms : 03.07. - 07.07.95
Average-case complexity of shortest-paths problems
Average-case complexity of shortest-paths problems
Average case competitive analyses for ski rental problems
Structural average case complexity
From worst-case to average-case efficiency : approximating combinatorial optimization problems
k-shortest path: average-case analysis and practical improvements
Fundamentals of the average case analysis of particular algorithms
Average-case intractability vs. worst-case intractability