Hochschulschrift | Online-Publikation
Completeness for parallel access to NP and counting class separations
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Düsseldorf, Univ., Diss., 2005
- Classification
-
Informatik
Mathematik
- Keyword
-
Komplexitätsklasse
Orakel
NP-vollständiges Problem
- Creator
-
Spakowski, Holger
- URN
-
urn:nbn:de:hbz:061-20050720-001172-8
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:37 AM 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
- Online-Publikation
Associated
- Spakowski, Holger
Other Objects (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