- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
93 S.
- Language
-
Englisch
- Notes
-
Heidelberg, Univ., Diss., 2000
- Keyword
-
NP-vollständiges Problem
Ressourcenbeschränkte Generizität
- 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:23 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.
Object type
- Hochschulschrift
Associated
Other Objects (12)
NP-completeness notions under strong hypotheses
Graph algorithms and NP-completeness
Teaching NP completeness in secondary schools
Weak completeness notions for exponential time
Completeness for parallel access to NP and counting class separations
Completeness for parallel access to NP and counting class separations
Completeness of Information Sources
Completeness of Information Sources
Informal rigour and completeness proofs
Note on completeness and definability
Completeness of integrated Information Sources
Completeness theory for propositional logics
NP-completeness notions under strong hypotheses
Graph algorithms and NP-completeness
Teaching NP completeness in secondary schools
Weak completeness notions for exponential time
Completeness for parallel access to NP and counting class separations
Completeness for parallel access to NP and counting class separations
Completeness of Information Sources
Completeness of Information Sources
Informal rigour and completeness proofs
Note on completeness and definability
Completeness of integrated Information Sources
Completeness theory for propositional logics
NP-completeness notions under strong hypotheses
Graph algorithms and NP-completeness
Teaching NP completeness in secondary schools
Weak completeness notions for exponential time
Completeness for parallel access to NP and counting class separations
Completeness for parallel access to NP and counting class separations
Completeness of Information Sources
Completeness of Information Sources
Informal rigour and completeness proofs
Note on completeness and definability
Completeness of integrated Information Sources