On the algebraic complexity of set equality and inclusion

Authors:
Irit Katriel
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
Information Processing Letters
Year:
2004

Citing 4
Cited 1

Lower bounds for algebraic computation trees with integer inputs

SIAM Journal on Computing
Sorting and Searching on the Word RAM

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The reliable algorithmic software challenge RASC

Computer Science in Perspective

Comparing with RSA

Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding

Quantified Score

Hi-index	0.89

Visualization

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.