- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
30 cm
- Extent
-
58 Bl.
- Language
-
Englisch
- Notes
-
graph. Darst.
Bonn, Univ., Habil.-Schr., 1984 (Nicht für den Austausch)
- Creator
-
Verbeek, Rutger
- 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, 1:55 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.
Object type
- Hochschulschrift
Associated
- Verbeek, Rutger
Other Objects (12)
Sparse matrix computations and their I O complexity
Sparse Matrix Computations and their I/O Complexity
Computations on words and their complexity
Verification of program computations
Complexity of turing machine computations, Course unit 3.. Polynomial time
The complexity of approximate optima for greatest common divisor computations
Concrete complexity theory : studies of the impact of the capabilities of the storage device on the efficiency of computations
Numerical computations of weakly compressible flows
Complexity of Gröbner bases computations and applications to cryptography - lecture 1
Complexity of Gröbner bases computations and applications to cryptography - lecture 2
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Algebraic computations in derived categories
Sparse matrix computations and their I O complexity
Sparse Matrix Computations and their I/O Complexity
Computations on words and their complexity
Verification of program computations
Complexity of turing machine computations, Course unit 3.. Polynomial time
The complexity of approximate optima for greatest common divisor computations
Concrete complexity theory : studies of the impact of the capabilities of the storage device on the efficiency of computations
Numerical computations of weakly compressible flows
Complexity of Gröbner bases computations and applications to cryptography - lecture 1
Complexity of Gröbner bases computations and applications to cryptography - lecture 2
Complexity of turing machine computations, Course units 1 and 2.. Introduction
Algebraic computations in derived categories
Sparse matrix computations and their I O complexity
Sparse Matrix Computations and their I/O Complexity
Computations on words and their complexity
Verification of program computations
Complexity of turing machine computations, Course unit 3.. Polynomial time
The complexity of approximate optima for greatest common divisor computations
Concrete complexity theory : studies of the impact of the capabilities of the storage device on the efficiency of computations
Numerical computations of weakly compressible flows
Complexity of Gröbner bases computations and applications to cryptography - lecture 1
Complexity of Gröbner bases computations and applications to cryptography - lecture 2
Complexity of turing machine computations, Course units 1 and 2.. Introduction