On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras.

Tarek Sayed Ahmed

Published in: Math. Log. Q. (2011)

Keyphrases

multi class
tractable cases
worst case
machine learning
class labels
databases
information systems
computational cost
np complete
space complexity
relation algebra