- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540674498
3540674497
- Dimensions
-
24 cm
- Extent
-
IX, 254 S.
- Language
-
Englisch
- Notes
-
Literaturverz. S. 227 - 244
- Bibliographic citation
-
Lecture notes in mathematics ; 1733
- Keyword
-
Stochastischer Prozess
Numerische Mathematik
Average-case-Komplexität
- 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.03.2025, 12:22 PM CET
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
- Ritter, Klaus
- Springer
Time of origin
- 2000
Other Objects (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