> Details

Barth, Dominik [Author]; Beck, Moritz [Author]; Dose, Titus [Author]; Glaßer, Christian [Author]; Michler, Larissa [Author]; Technau, Marc [Author] ; Dominik Barth and Moritz Beck and Titus Dose and Christian Glaßer and Larissa Michler and Marc Technau [Contributor]

Emptiness Problems for Integer Circuits

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article; Electronic Conference Proceeding
  • Title: Emptiness Problems for Integer Circuits
  • Contributor: Barth, Dominik [Author]; Beck, Moritz [Author]; Dose, Titus [Author]; Glaßer, Christian [Author]; Michler, Larissa [Author]; Technau, Marc [Author]
  • Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.MFCS.2017.33
  • Keywords: integer circuits ; computational complexity ; integer expressions ; polynomial identity testing
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: We study the computational complexity of emptiness problems for circuits over sets of natural numbers with the operations union, intersection, complement, addition, and multiplication. For most settings of allowed operations we precisely characterize the complexity in terms of completeness for classes like NL, NP, and PSPACE. The case where intersection, addition, and multiplication is allowed turns out to be equivalent to the complement of polynomial identity testing (PIT). Our results imply the following improvements and insights on problems studied in earlier papers. We improve the bounds for the membership problem MC(\cup,\cap,¯,+,×) studied by McKenzie and Wagner 2007 and for the equivalence problem EQ(\cup,\cap,¯,+,×) studied by Glaßer et al. 2010. Moreover, it turns out that the following problems are equivalent to PIT, which shows that the challenge to improve their bounds is just a reformulation of a major open problem in algebraic computing complexity: 1. membership problem MC(\cap,+,×) studied by McKenzie and Wagner 2007 2. integer membership problems MC_Z(+,×), MC_Z(\cap,+,×) studied by Travers 2006 3. equivalence problem EQ(+,×) studied by Glaßer et al. 2010
  • Access State: Open Access