computational complexity

, Volume 16, Issue 3, pp 211–244

The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

Article

DOI: 10.1007/s00037-007-0229-6

Cite this article as:
McKenzie, P. & Wagner, K.W. comput. complex. (2007) 16: 211. doi:10.1007/s00037-007-0229-6

Abstract.

The problem of testing membership in the subset of the natural numbers produced at the output gate of a {\(\bigcup, \bigcap, ^-, +, \times\)} combinational circuit is shown to capture a wide range of complexity classes. Although the general problem remains open, the case {\(\bigcup, \bigcap, +, \times\)} is shown NEXPTIME-complete, the cases {\(\bigcup, \bigcap, ^-, \times\) }, {\(\bigcup, \bigcap, \times\)}, {\(\bigcup, \bigcap, +\)} are shown PSPACE-complete, the case {\(\bigcup, +\) } is shown NP-complete, the case {∩, +} is shown C=L-complete, and several other cases are resolved. Interesting auxiliary problems are used, such as testing nonemptyness for union-intersection-concatenation circuits, and expressing each integer, drawn from a set given as input, as powers of relatively prime integers of one’s choosing. Our results extend in nontrivial ways past work by Stockmeyer and Meyer (1973), Wagner (1984) and Yang (2000).

Keywords.

Computational complexity circuit problems 

Subject classification.

68Q25 68Q15 03D15 

Copyright information

© Birkhaeuser 2007

Authors and Affiliations

  1. 1.Informatique et recherche opérationnelleUniversité de MontréalSucc. Centre-Ville MontréalCanada
  2. 2.Theoretische InformatikJulius-Maximilians-Universität WürzburgWürzburgGermany