The Complexity of Membership Problems for Circuits over Sets of Integers

Stephen D. Travers. The Complexity of Membership Problems for Circuits over Sets of Integers. In Jirí Fiala, Václav Koubek, Jan Kratochvíl, editors, Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings. Volume 3153 of Lecture Notes in Computer Science, pages 322-333, Springer, 2004. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.