On the Algebraic Complexity of Set Equality and Inclusion
- Publication date
- Publisher
Abstract
We present a linear-time algorithm in the algebraic computation tree model
for checking whether two sets of integers are equal.
The significance of this result is in the fact that
it shows that set equality testing is computationally easier when the elements
of the sets are restricted to be integers. In addition, we show a linear-time
algorithm for checking set inclusion in a slightly extended computational
model