Publikation:

The Complexity of Computing the Size of an Interval

Lade...
Vorschaubild

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2001

Autor:innen

Hemaspaandra, Lane A.
Wagner, Klaus W.

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

OREJAS, Fernando, ed., Paul G. SPIRAKIS, ed., Jan VAN LEEUWEN, ed.. Automata, Languages and Programming : 28th International Colloquium, ICALP 2001, Proceedings. Berlin: Springer, 2001, pp. 1040-1051. Lecture Notes in Computer Science. 2076. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-540-42287-7. Available under: doi: 10.1007/3-540-48224-5_84

Zusammenfassung

We study the complexity of counting the number of elements in intervals of feasible partial orders. Depending on the properties that partial orders may have, such counting functions have different complexities. If we consider total, polynomial-time decidable orders then we obtain exactly the #P functions. We show that the interval size functions for polynomial-time adjacency checkable orders are tightly related to the class FPSPACE(poly): Every FPSPACE(poly) function equals a polynomial-time function subtracted from such an interval size function. We study the function #DIV that counts the nontrivial divisors of natural numbers, and we show that #DIV is the interval size function of a polynomial-time decidable partial order with polynomial-time adjacency checks if and only if primality is in polynomial time.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

International Colloquium on Automata, Languages, and Programming, 8. Juli 2001 - 12. Juli 2001, Crete, Greece
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690HEMASPAANDRA, Lane A., Sven KOSUB, Klaus W. WAGNER, 2001. The Complexity of Computing the Size of an Interval. International Colloquium on Automata, Languages, and Programming. Crete, Greece, 8. Juli 2001 - 12. Juli 2001. In: OREJAS, Fernando, ed., Paul G. SPIRAKIS, ed., Jan VAN LEEUWEN, ed.. Automata, Languages and Programming : 28th International Colloquium, ICALP 2001, Proceedings. Berlin: Springer, 2001, pp. 1040-1051. Lecture Notes in Computer Science. 2076. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-540-42287-7. Available under: doi: 10.1007/3-540-48224-5_84
BibTex
@inproceedings{Hemaspaandra2001-07-04Compl-44988,
  year={2001},
  doi={10.1007/3-540-48224-5_84},
  title={The Complexity of Computing the Size of an Interval},
  number={2076},
  isbn={978-3-540-42287-7},
  issn={0302-9743},
  publisher={Springer},
  address={Berlin},
  series={Lecture Notes in Computer Science},
  booktitle={Automata, Languages and Programming : 28th International Colloquium, ICALP 2001, Proceedings},
  pages={1040--1051},
  editor={Orejas, Fernando and Spirakis, Paul G. and van Leeuwen, Jan},
  author={Hemaspaandra, Lane A. and Kosub, Sven and Wagner, Klaus W.}
}
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/44988">
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Kosub, Sven</dc:contributor>
    <dcterms:title>The Complexity of Computing the Size of an Interval</dcterms:title>
    <dc:contributor>Hemaspaandra, Lane A.</dc:contributor>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-12T12:07:47Z</dc:date>
    <dcterms:abstract xml:lang="eng">We study the complexity of counting the number of elements in intervals of feasible partial orders. Depending on the properties that partial orders may have, such counting functions have different complexities. If we consider total, polynomial-time decidable orders then we obtain exactly the #P functions. We show that the interval size functions for polynomial-time adjacency checkable orders are tightly related to the class FPSPACE(poly): Every FPSPACE(poly) function equals a polynomial-time function subtracted from such an interval size function. We study the function #DIV that counts the nontrivial divisors of natural numbers, and we show that #DIV is the interval size function of a polynomial-time decidable partial order with polynomial-time adjacency checks if and only if primality is in polynomial time.</dcterms:abstract>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-02-12T12:07:47Z</dcterms:available>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/44988"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Hemaspaandra, Lane A.</dc:creator>
    <dc:creator>Kosub, Sven</dc:creator>
    <dc:creator>Wagner, Klaus W.</dc:creator>
    <dc:contributor>Wagner, Klaus W.</dc:contributor>
    <dcterms:issued>2001-07-04</dcterms:issued>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen