Efficiency of Equivalence Algorithms
This paper was first presented at the Symposium on Complexity of Computer Computations, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, on March 22, 1972. The equivalence problem is to determine the finest partition on a set that is consistent with a sequence of assertions of the...
Main Author: | Fischer, Michael J. |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/6201 |
Similar Items
-
Faster algorithms for Markov equivalence
by: Hu, Z, et al.
Published: (2020) -
VLSD—An Efficient Subgroup Discovery Algorithm Based on Equivalence Classes and Optimistic Estimate
by: Antonio Lopez-Martinez-Carrasco, et al.
Published: (2023-05-01) -
On Equivalence Relationships Between Classification and Ranking Algorithms
by: Rudin, Cynthia, et al.
Published: (2012) -
On equivalence relationships between classification and ranking algorithms
by: Ertekin, Seyda, et al.
Published: (2012) -
Equivalence classes in the set of efficient solutions
by: Liana Lupşa, et al.
Published: (1996-08-01)