Hochschulschrift | Online-Publikation
NP-completeness notions under strong hypotheses
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Sprache
-
Englisch
- Anmerkungen
-
Heidelberg, Univ., Diss., 2000
- Schlagwort
-
NP-vollständiges Problem
Ressourcenbeschränkte Generizität
- Urheber
- URN
-
urn:nbn:de:bsz:16-opus-13840
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:31 MESZ
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
- Online-Publikation
Beteiligte
Ähnliche Objekte (12)
NP-completeness notions under strong hypotheses
Graph algorithms and NP-completeness
Weak completeness notions for exponential time
Teaching NP completeness in secondary schools
NP-Completeness Results for Minimum Planar Spanners
Completeness for parallel access to NP and counting class separations
On the NP-Completeness of Channel and Switchbox Routing Problems
Completeness for parallel access to NP and counting class separations
NP-completeness of small conflict set generation for congruence closure
Involutive Uninorm Logic with Fixed Point enjoys finite strong standard completeness
NP-Completeness and Physical Zero-Knowledge Proofs for Sumplete, a Puzzle Generated by ChatGPT
Notions.
NP-completeness notions under strong hypotheses
Graph algorithms and NP-completeness
Weak completeness notions for exponential time
Teaching NP completeness in secondary schools
NP-Completeness Results for Minimum Planar Spanners
Completeness for parallel access to NP and counting class separations
On the NP-Completeness of Channel and Switchbox Routing Problems
Completeness for parallel access to NP and counting class separations
NP-completeness of small conflict set generation for congruence closure
Involutive Uninorm Logic with Fixed Point enjoys finite strong standard completeness
NP-Completeness and Physical Zero-Knowledge Proofs for Sumplete, a Puzzle Generated by ChatGPT
Notions.
NP-completeness notions under strong hypotheses
Graph algorithms and NP-completeness
Weak completeness notions for exponential time
Teaching NP completeness in secondary schools
NP-Completeness Results for Minimum Planar Spanners
Completeness for parallel access to NP and counting class separations
On the NP-Completeness of Channel and Switchbox Routing Problems
Completeness for parallel access to NP and counting class separations
NP-completeness of small conflict set generation for congruence closure
Involutive Uninorm Logic with Fixed Point enjoys finite strong standard completeness
NP-Completeness and Physical Zero-Knowledge Proofs for Sumplete, a Puzzle Generated by ChatGPT