- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
21 cm
- Umfang
-
93 S.
- Sprache
-
Englisch
- Anmerkungen
-
Heidelberg, Univ., Diss., 2000
- Schlagwort
-
NP-vollständiges Problem
Ressourcenbeschränkte Generizität
- 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:23 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.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (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