Hochschulschrift | Online-Publikation
Completeness for parallel access to NP and counting class separations
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Düsseldorf, Univ., Diss., 2005
- Klassifikation
-
Informatik
Mathematik
- Schlagwort
-
Komplexitätsklasse
Orakel
NP-vollständiges Problem
- Urheber
-
Spakowski, Holger
- URN
-
urn:nbn:de:hbz:061-20050720-001172-8
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
13.08.2027, 07:37 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
- Spakowski, Holger
Ähnliche Objekte (12)
Completeness for parallel access to NP and counting class separations
Graph algorithms and NP-completeness
NP-completeness notions under strong hypotheses
Teaching NP completeness in secondary schools
NP-completeness notions under strong hypotheses
NP-Completeness Results for Minimum Planar Spanners
On the NP-Completeness of Channel and Switchbox Routing Problems
NP-completeness of small conflict set generation for congruence closure
NP-Completeness and Physical Zero-Knowledge Proofs for Sumplete, a Puzzle Generated by ChatGPT
Massively Parallel Coincidence Counting of High-Dimensional Entangled States
Counting Parallel Segments: New Variants of Pick’s Area Theorem
N.P.
Completeness for parallel access to NP and counting class separations
Graph algorithms and NP-completeness
NP-completeness notions under strong hypotheses
Teaching NP completeness in secondary schools
NP-completeness notions under strong hypotheses
NP-Completeness Results for Minimum Planar Spanners
On the NP-Completeness of Channel and Switchbox Routing Problems
NP-completeness of small conflict set generation for congruence closure
NP-Completeness and Physical Zero-Knowledge Proofs for Sumplete, a Puzzle Generated by ChatGPT
Massively Parallel Coincidence Counting of High-Dimensional Entangled States
Counting Parallel Segments: New Variants of Pick’s Area Theorem
N.P.
Completeness for parallel access to NP and counting class separations
Graph algorithms and NP-completeness
NP-completeness notions under strong hypotheses
Teaching NP completeness in secondary schools
NP-completeness notions under strong hypotheses
NP-Completeness Results for Minimum Planar Spanners
On the NP-Completeness of Channel and Switchbox Routing Problems
NP-completeness of small conflict set generation for congruence closure
NP-Completeness and Physical Zero-Knowledge Proofs for Sumplete, a Puzzle Generated by ChatGPT
Massively Parallel Coincidence Counting of High-Dimensional Entangled States
Counting Parallel Segments: New Variants of Pick’s Area Theorem