Equivalence Problems for Circuits over Sets of Natural Numbers

Abstract

We investigate the complexity of equivalence problems for {∪,∩,−,+,×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer and Meyer (1973). We continue this line of research and give a systematic characterization of the complexity of equivalence problems over sets of natural numbers. Our work shows that equivalence… (More)
DOI: 10.1007/s00224-008-9144-8

Topics

1 Figure or Table

Slides referencing similar topics