Boolean NP-Partitions and Projective Closure

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

KOSUB, Sven, 2003. Boolean NP-Partitions and Projective Closure. International Conference on Discrete Mathematics and Theoretical Computer Science. Dijon, France, Jul 7, 2003 - Jul 12, 2003. In: CALUDE, Christian S., ed., Michael J. DINNEEN, ed., Vincent VAJNOVSZKI, ed.. Discrete Mathematics and Theoretical Computer Science : 4th International Conference, DMTCS 2003, Proceedings. Berlin:Springer, pp. 225-236. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-540-40505-4. Available under: doi: 10.1007/3-540-45066-1_18

@inproceedings{Kosub2003-06-18Boole-44986, title={Boolean NP-Partitions and Projective Closure}, year={2003}, doi={10.1007/3-540-45066-1_18}, number={2731}, isbn={978-3-540-40505-4}, issn={0302-9743}, address={Berlin}, publisher={Springer}, series={Lecture Notes in Computer Science}, booktitle={Discrete Mathematics and Theoretical Computer Science : 4th International Conference, DMTCS 2003, Proceedings}, pages={225--236}, editor={Calude, Christian S. and Dinneen, Michael J. and Vajnovszki, Vincent}, author={Kosub, Sven} }

<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/44986"> <dc:contributor>Kosub, Sven</dc:contributor> <dcterms:abstract xml:lang="eng">When studying complexity classes of partitions we often face the situation that different partition classes have the same component classes. The projective closures are the largest classes among these with respect to set inclusion. In this paper we investigate projective closures of classes of boolean NP-partitions, i.e., partitions with components that have complexity upper-bounds in the boolean hierarchy over NP. We prove that the projective closures of these classes are represented by finite labeled posets. We give algorithms for calculating these posets and related problems. As a consequence we obtain representations of the set classes NP(m) ∩ coNP(m) by means of finite labeled posets.</dcterms:abstract> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44986"/> <dc:language>eng</dc:language> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-12T11:59:37Z</dcterms:available> <dcterms:title>Boolean NP-Partitions and Projective Closure</dcterms:title> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-12T11:59:37Z</dc:date> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:issued>2003-06-18</dcterms:issued> <dc:creator>Kosub, Sven</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


Browse

My Account