Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.ipl.2004.07.006 | Inf. Process. Lett. |
Keywords | Field | DocType |
extended computational model,algebraic computation tree model,algebraic complexity,linear-time algorithm,set equality testing,computational models,computer model,computational complexity | Integer,Discrete mathematics,Combinatorics,Algebra of sets,Information processing,Symbolic computation,Decision tree model,Computational model,Time complexity,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
92 | 4 | 0020-0190 |
Citations | PageRank | References |
2 | 0.41 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Irit Katriel | 1 | 176 | 13.72 |