Equivalence Problems for Circuits over Sets of Natural Numbers View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2007-01-01

AUTHORS

Christian Glaßer , Katrin Herr , Christian Reitwießner , Stephen Travers , Matthias Waldherr

ABSTRACT

We investigate the complexity of equivalence problems for { ∪ , ∩ , −, + ,×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer and Meyer (1973). We continue this line of research and give a systematic characterization of the complexity of equivalence problems over sets of natural numbers. Our work shows that equivalence problems capture a wide range of complexity classes like NL, C=L, P,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\rm \Pi^P_{2}}$\end{document}, PSPACE, NEXP, and beyond. McKenzie and Wagner (2003) studied related membership problems for circuits over sets of natural numbers. Our results also have consequences for these membership problems: We provide an improved upper bound for the case of { ∪ , ∩ , −, + ,×}-circuits. More... »

PAGES

127-138

Book

TITLE

Computer Science – Theory and Applications

ISBN

978-3-540-74509-9
978-3-540-74510-5

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-74510-5_15

DOI

http://dx.doi.org/10.1007/978-3-540-74510-5_15

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1008732500


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Theoretische Informatik, Germany", 
          "id": "http://www.grid.ac/institutes/grid.8379.5", 
          "name": [
            "Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Theoretische Informatik, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Gla\u00dfer", 
        "givenName": "Christian", 
        "id": "sg:person.010502766006.46", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010502766006.46"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Theoretische Informatik, Germany", 
          "id": "http://www.grid.ac/institutes/grid.8379.5", 
          "name": [
            "Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Theoretische Informatik, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Herr", 
        "givenName": "Katrin", 
        "id": "sg:person.010127676033.33", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010127676033.33"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Theoretische Informatik, Germany", 
          "id": "http://www.grid.ac/institutes/grid.8379.5", 
          "name": [
            "Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Theoretische Informatik, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Reitwie\u00dfner", 
        "givenName": "Christian", 
        "id": "sg:person.013115600033.81", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013115600033.81"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Theoretische Informatik, Germany", 
          "id": "http://www.grid.ac/institutes/grid.8379.5", 
          "name": [
            "Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Theoretische Informatik, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Travers", 
        "givenName": "Stephen", 
        "id": "sg:person.07734242057.72", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07734242057.72"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Theoretische Informatik, Germany", 
          "id": "http://www.grid.ac/institutes/grid.8379.5", 
          "name": [
            "Julius-Maximilians-Universit\u00e4t W\u00fcrzburg, Theoretische Informatik, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Waldherr", 
        "givenName": "Matthias", 
        "id": "sg:person.07404271733.31", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07404271733.31"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2007-01-01", 
    "datePublishedReg": "2007-01-01", 
    "description": "We investigate the complexity of equivalence problems for {\u2009\u222a\u2009,\u2009\u2229\u2009, \u2212,\u2009+\u2009,\u00d7}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer and Meyer (1973). We continue this line of research and give a systematic characterization of the complexity of equivalence problems over sets of natural numbers. Our work shows that equivalence problems capture a wide range of complexity classes like NL, C=L, P,\\documentclass[12pt]{minimal}\n\t\t\t\t\\usepackage{amsmath}\n\t\t\t\t\\usepackage{wasysym}\n\t\t\t\t\\usepackage{amsfonts}\n\t\t\t\t\\usepackage{amssymb}\n\t\t\t\t\\usepackage{amsbsy}\n\t\t\t\t\\usepackage{mathrsfs}\n\t\t\t\t\\usepackage{upgreek}\n\t\t\t\t\\setlength{\\oddsidemargin}{-69pt}\n\t\t\t\t\\begin{document}${\\rm \\Pi^P_{2}}$\\end{document}, PSPACE, NEXP, and beyond. McKenzie and Wagner (2003) studied related membership problems for circuits over sets of natural numbers. Our results also have consequences for these membership problems: We provide an improved upper bound for the case of {\u2009\u222a\u2009,\u2009\u2229\u2009, \u2212,\u2009+\u2009,\u00d7}-circuits.", 
    "editor": [
      {
        "familyName": "Diekert", 
        "givenName": "Volker", 
        "type": "Person"
      }, 
      {
        "familyName": "Volkov", 
        "givenName": "Mikhail V.", 
        "type": "Person"
      }, 
      {
        "familyName": "Voronkov", 
        "givenName": "Andrei", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-74510-5_15", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-74509-9", 
        "978-3-540-74510-5"
      ], 
      "name": "Computer Science \u2013 Theory and Applications", 
      "type": "Book"
    }, 
    "keywords": [
      "natural numbers", 
      "equivalence problem", 
      "membership problem", 
      "complexity classes", 
      "problem", 
      "set", 
      "complexity", 
      "PSPACE", 
      "circuit", 
      "Stockmeyer", 
      "wide range", 
      "NEXP", 
      "number", 
      "class", 
      "line of research", 
      "McKenzie", 
      "Wagner", 
      "systematic characterization", 
      "cases", 
      "Meyer", 
      "work", 
      "results", 
      "range", 
      "NL", 
      "lines", 
      "characterization", 
      "consequences", 
      "research"
    ], 
    "name": "Equivalence Problems for Circuits over Sets of Natural Numbers", 
    "pagination": "127-138", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1008732500"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-74510-5_15"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-74510-5_15", 
      "https://app.dimensions.ai/details/publication/pub.1008732500"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-08-04T17:14", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/chapter/chapter_13.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-74510-5_15"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-74510-5_15'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-74510-5_15'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-74510-5_15'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-74510-5_15'


 

This table displays all metadata directly associated to this object as RDF triples.

125 TRIPLES      22 PREDICATES      52 URIs      45 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-74510-5_15 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N3a311891a3fc422a8bab60428ac994a9
4 schema:datePublished 2007-01-01
5 schema:datePublishedReg 2007-01-01
6 schema:description We investigate the complexity of equivalence problems for { ∪ , ∩ , −, + ,×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer and Meyer (1973). We continue this line of research and give a systematic characterization of the complexity of equivalence problems over sets of natural numbers. Our work shows that equivalence problems capture a wide range of complexity classes like NL, C=L, P,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\rm \Pi^P_{2}}$\end{document}, PSPACE, NEXP, and beyond. McKenzie and Wagner (2003) studied related membership problems for circuits over sets of natural numbers. Our results also have consequences for these membership problems: We provide an improved upper bound for the case of { ∪ , ∩ , −, + ,×}-circuits.
7 schema:editor N9700977aee1d48eca625bbaaa5adbe7c
8 schema:genre chapter
9 schema:isAccessibleForFree false
10 schema:isPartOf N06d6d75d50fd409f96da2578ff30d576
11 schema:keywords McKenzie
12 Meyer
13 NEXP
14 NL
15 PSPACE
16 Stockmeyer
17 Wagner
18 cases
19 characterization
20 circuit
21 class
22 complexity
23 complexity classes
24 consequences
25 equivalence problem
26 line of research
27 lines
28 membership problem
29 natural numbers
30 number
31 problem
32 range
33 research
34 results
35 set
36 systematic characterization
37 wide range
38 work
39 schema:name Equivalence Problems for Circuits over Sets of Natural Numbers
40 schema:pagination 127-138
41 schema:productId N407a77a834d84b85b65d3a10c082c75a
42 Nc2d88e8ef69f483da4a8e210634054e9
43 schema:publisher Nfa2395253de94c30b404df024b367043
44 schema:sameAs https://app.dimensions.ai/details/publication/pub.1008732500
45 https://doi.org/10.1007/978-3-540-74510-5_15
46 schema:sdDatePublished 2022-08-04T17:14
47 schema:sdLicense https://scigraph.springernature.com/explorer/license/
48 schema:sdPublisher N94ca0a6d2e7647fbb840618389286228
49 schema:url https://doi.org/10.1007/978-3-540-74510-5_15
50 sgo:license sg:explorer/license/
51 sgo:sdDataset chapters
52 rdf:type schema:Chapter
53 N06d6d75d50fd409f96da2578ff30d576 schema:isbn 978-3-540-74509-9
54 978-3-540-74510-5
55 schema:name Computer Science – Theory and Applications
56 rdf:type schema:Book
57 N3a311891a3fc422a8bab60428ac994a9 rdf:first sg:person.010502766006.46
58 rdf:rest N79121d535daf4a56940a750497f66fac
59 N3ab7934a816b46bbb68af4c1385dd99d schema:familyName Volkov
60 schema:givenName Mikhail V.
61 rdf:type schema:Person
62 N407a77a834d84b85b65d3a10c082c75a schema:name dimensions_id
63 schema:value pub.1008732500
64 rdf:type schema:PropertyValue
65 N6fa860e90ad24b6ea8b4977a87757e06 rdf:first sg:person.07404271733.31
66 rdf:rest rdf:nil
67 N79121d535daf4a56940a750497f66fac rdf:first sg:person.010127676033.33
68 rdf:rest N7b1da22175a14447ae7e1aecfbe6487f
69 N7b1da22175a14447ae7e1aecfbe6487f rdf:first sg:person.013115600033.81
70 rdf:rest N867d1d9c6de34a7db7c988504fabb48f
71 N80d02375743e4e82838230ddd22f8709 schema:familyName Voronkov
72 schema:givenName Andrei
73 rdf:type schema:Person
74 N867d1d9c6de34a7db7c988504fabb48f rdf:first sg:person.07734242057.72
75 rdf:rest N6fa860e90ad24b6ea8b4977a87757e06
76 N94ca0a6d2e7647fbb840618389286228 schema:name Springer Nature - SN SciGraph project
77 rdf:type schema:Organization
78 N9700977aee1d48eca625bbaaa5adbe7c rdf:first Nbd5764d018a54012a7ad24db392c167b
79 rdf:rest Ncb13f504b4f541d58605df73dba03897
80 Nbd5764d018a54012a7ad24db392c167b schema:familyName Diekert
81 schema:givenName Volker
82 rdf:type schema:Person
83 Nc2d88e8ef69f483da4a8e210634054e9 schema:name doi
84 schema:value 10.1007/978-3-540-74510-5_15
85 rdf:type schema:PropertyValue
86 Ncb13f504b4f541d58605df73dba03897 rdf:first N3ab7934a816b46bbb68af4c1385dd99d
87 rdf:rest Ndd7e9bacdc4f4c5bb6b1e6793f30c025
88 Ndd7e9bacdc4f4c5bb6b1e6793f30c025 rdf:first N80d02375743e4e82838230ddd22f8709
89 rdf:rest rdf:nil
90 Nfa2395253de94c30b404df024b367043 schema:name Springer Nature
91 rdf:type schema:Organisation
92 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
93 schema:name Information and Computing Sciences
94 rdf:type schema:DefinedTerm
95 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
96 schema:name Computation Theory and Mathematics
97 rdf:type schema:DefinedTerm
98 sg:person.010127676033.33 schema:affiliation grid-institutes:grid.8379.5
99 schema:familyName Herr
100 schema:givenName Katrin
101 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010127676033.33
102 rdf:type schema:Person
103 sg:person.010502766006.46 schema:affiliation grid-institutes:grid.8379.5
104 schema:familyName Glaßer
105 schema:givenName Christian
106 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010502766006.46
107 rdf:type schema:Person
108 sg:person.013115600033.81 schema:affiliation grid-institutes:grid.8379.5
109 schema:familyName Reitwießner
110 schema:givenName Christian
111 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013115600033.81
112 rdf:type schema:Person
113 sg:person.07404271733.31 schema:affiliation grid-institutes:grid.8379.5
114 schema:familyName Waldherr
115 schema:givenName Matthias
116 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07404271733.31
117 rdf:type schema:Person
118 sg:person.07734242057.72 schema:affiliation grid-institutes:grid.8379.5
119 schema:familyName Travers
120 schema:givenName Stephen
121 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07734242057.72
122 rdf:type schema:Person
123 grid-institutes:grid.8379.5 schema:alternateName Julius-Maximilians-Universität Würzburg, Theoretische Informatik, Germany
124 schema:name Julius-Maximilians-Universität Würzburg, Theoretische Informatik, Germany
125 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...