Types of Separability

dc.contributor.authorKosub, Sven
dc.date.accessioned2021-12-10T14:57:07Z
dc.date.available2021-12-10T14:57:07Z
dc.date.issued2000eng
dc.description.abstractIn 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.eng
dc.description.versionpublishedeng
dc.identifier.ppn1781000263
dc.identifier.urihttps://kops.uni-konstanz.de/handle/123456789/55842
dc.language.isoengeng
dc.relation.ispartofseriesTechnical Reports, Institut für Informatik, Universität Würzburgeng
dc.rightsterms-of-use
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/
dc.subjectComplexity, NP, Partitionseng
dc.subject.ddc004eng
dc.titleTypes of Separabilityeng
dc.typeWORKINGPAPEReng
dspace.entity.typePublication
kops.bibliographicInfo.seriesNumber267eng
kops.citation.bibtex
@techreport{Kosub2000Types-55842,
  year={2000},
  series={Technical Reports, Institut für Informatik, Universität Würzburg},
  title={Types of Separability},
  number={267},
  url={http://www1.pub.informatik.uni-wuerzburg.de/pub/TRs/tr267.ps.gz},
  author={Kosub, Sven}
}
kops.citation.iso690KOSUB, Sven, 2000. Types of Separabilitydeu
kops.citation.iso690KOSUB, Sven, 2000. Types of Separabilityeng
kops.citation.rdf
<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/server/rdf/resource/123456789/55842">
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-10T14:57:07Z</dc:date>
    <dc:contributor>Kosub, Sven</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/55842/3/Kosub_2-1t8g7s2i052l26.pdf"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55842"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/55842/3/Kosub_2-1t8g7s2i052l26.pdf"/>
    <dcterms:issued>2000</dcterms:issued>
    <dcterms:title>Types of Separability</dcterms:title>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Kosub, Sven</dc:creator>
    <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:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-10T14:57:07Z</dcterms:available>
  </rdf:Description>
</rdf:RDF>
kops.description.openAccessopenaccessgreen
kops.flag.knbibliographyfalse
kops.identifier.nbnurn:nbn:de:bsz:352-2-1t8g7s2i052l26
kops.urlhttp://www1.pub.informatik.uni-wuerzburg.de/pub/TRs/tr267.ps.gzeng
kops.urlDate2021-12-10eng
relation.isAuthorOfPublicationea344a6b-b2fa-44ad-87b7-5a9fc26c81b7
relation.isAuthorOfPublication.latestForDiscoveryea344a6b-b2fa-44ad-87b7-5a9fc26c81b7

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
Kosub_2-1t8g7s2i052l26.pdf
Größe:
255.23 KB
Format:
Adobe Portable Document Format
Beschreibung:
Kosub_2-1t8g7s2i052l26.pdf
Kosub_2-1t8g7s2i052l26.pdfGröße: 255.23 KBDownloads: 643

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild nicht verfügbar
Name:
license.txt
Größe:
3.96 KB
Format:
Item-specific license agreed upon to submission
Beschreibung:
license.txt
license.txtGröße: 3.96 KBDownloads: 0