# The Complexity of Membership Problems for Circuits over Sets of Integers

@inproceedings{Travers2004TheCO,
title={The Complexity of Membership Problems for Circuits over Sets of Integers},
author={Stephen D. Travers},
booktitle={MFCS},
year={2004}
}
• Stephen D. Travers
• Published in MFCS 2004
• Mathematics, Computer Science
• We investigate the complexity of membership problems for $$\{\cup,\cap,\!\bar{\quad},+,\times\}$$-circuits computing sets of integers. These problems are a natural modification of the membership problems for circuits computing sets of natural numbers studied by McKenzie and Wagner (2003). We show that there are several membership problems for which the complexity in the case of integers differs significantly from the case of the natural numbers: Testing membership in the subset of integers… CONTINUE READING

#### Topics from this paper.

Evaluation of Circuits Over Nilpotent and Polycyclic Groups
• Computer Science, Mathematics
• 2017
• 9
• Highly Influenced
• PDF
On equations over sets of integers
• Computer Science, Mathematics
• 2010
• 5
• PDF
Emptiness Problems for Integer Circuits
• Computer Science, Mathematics
• 2017
• 4
• Highly Influenced
• PDF
Complexity of Equations over Sets of Natural Numbers
• Computer Science, Mathematics
• 2009
• 30
• PDF
Balance Problems for Integer Circuits
• T. Dose
• Computer Science, Mathematics
• 2018
Functions Definable by Arithmetic Circuits
• Mathematics, Computer Science
• 2009
• 11
• PDF