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

@article{McKenzie2007TheCO,
title={The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers},
author={Pierre McKenzie and Klaus W. Wagner},
journal={computational complexity},
year={2007},
volume={16},
pages={211-244}
}
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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations
Highly Influenced
20 Excerpts
Highly Influenced
11 Excerpts
Highly Influenced
6 Excerpts
Highly Influenced
20 Excerpts
Highly Influenced
10 Excerpts
Highly Influenced
4 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 34 references

The complexity of problems concerning graphs with regularities

• K. W. Wagner
• Proceedings 11th Mathematical Foundations of…
• 1984
Highly Influential
20 Excerpts
Highly Influential
13 Excerpts

Non - commutative arithmetic circuits : depthreduction and depth lower bounds

• J. Jiao E. Allender, M. Mahajan, V. Vinay
• Theoretical Computer Science
• 2002
2 Excerpts
2 Excerpts

Division in logspaceuniform NC 1 , RAIRO Theoret

• G. Davida A. Chiu
• Inform . Appl .
• 2001