Gå direkte til innholdet
Fundamentals of Computation Theory
Spar

Fundamentals of Computation Theory

- Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds.
Undertittel
International Conference FCT '89, Szeged, Hungary, August 21-25, 1989. Proceedings
Opplag
1989 ed.
ISBN
9783540514985
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
31.7.1989
Antall sider
498