The Boolean Hierarchy of NP-Partitions

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

KOSUB, Sven, Klaus W. WAGNER, 2000. The Boolean Hierarchy of NP-Partitions. Annual Symposium on Theoretical Aspects of Computer Science : STACS 2000. Lille, France, Feb 17, 2000 - Feb 19, 2000. In: REICHEL, Horst, ed., Sophie TISON, ed.. STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Berlin:Springer, pp. 157-168. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-540-67141-1. Available under: doi: 10.1007/3-540-46541-3_13

@inproceedings{Kosub2000-03-24Boole-44989, title={The Boolean Hierarchy of NP-Partitions}, year={2000}, doi={10.1007/3-540-46541-3_13}, number={1770}, isbn={978-3-540-67141-1}, issn={0302-9743}, address={Berlin}, publisher={Springer}, series={Lecture Notes in Computer Science}, booktitle={STACS 2000 : 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings}, pages={157--168}, editor={Reichel, Horst and Tison, Sophie}, author={Kosub, Sven and Wagner, Klaus W.} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/44989"> <dc:creator>Kosub, Sven</dc:creator> <dcterms:issued>2000-03-24</dcterms:issued> <dcterms:abstract xml:lang="eng">We introduce the boolean hierarchy of k-partitions over NP for k ≥ 3 as a generalization of the boolean hierarchy of sets (i.e., 2-partitions) over NP. Whereas the structure of the latter hierarchy is rather simple the structure of the boolean hierarchy of k-partitions over NP for k ≥ 3 turns out to be much more complicated. We establish the Embedding Conjecture which enables us to get a complete idea of this structure. This conjecture is supported by several partial results.</dcterms:abstract> <dcterms:title>The Boolean Hierarchy of NP-Partitions</dcterms:title> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-12T12:13:43Z</dc:date> <dc:contributor>Kosub, Sven</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Wagner, Klaus W.</dc:contributor> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44989"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-12T12:13:43Z</dcterms:available> <dc:creator>Wagner, Klaus W.</dc:creator> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account