Types of Separability

Cite This

Files in this item

Checksum: MD5:dad4e733c35be8221445766ac879a39a

KOSUB, Sven, 2000. Types of Separability

@techreport{Kosub2000Types-55842, series={Technical Reports, Institut für Informatik, Universität Würzburg}, title={Types of Separability}, url={http://www1.pub.informatik.uni-wuerzburg.de/pub/TRs/tr267.ps.gz}, year={2000}, number={267}, 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/55842"> <dc:contributor>Kosub, Sven</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55842"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-10T14:57:07Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-10T14:57:07Z</dc:date> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:issued>2000</dcterms:issued> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/55842/3/Kosub_2-1t8g7s2i052l26.pdf"/> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:abstract xml:lang="eng">In this paper we demonstrate that the studies of structural properties of the boolean hierarchy of NP-partitions are not only worthwhile in their own, e.g., as a framework for capturing the complexity of classification problems, but have interesting ties with other research in computational complexity: We discuss the relationships to the study of separable NP sets.</dcterms:abstract> <dcterms:title>Types of Separability</dcterms:title> <dc:rights>terms-of-use</dc:rights> <dc:creator>Kosub, Sven</dc:creator> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/55842/3/Kosub_2-1t8g7s2i052l26.pdf"/> </rdf:Description> </rdf:RDF>

Downloads since Dec 10, 2021 (Information about access statistics)

Kosub_2-1t8g7s2i052l26.pdf 495

This item appears in the following Collection(s)

Search KOPS


Browse

My Account