Locally solvable subgroups of PLo(I) are countable.

Published in: Int. J. Algebra Comput. (2019)

Keyphrases

special case
np complete
np hard
markov chain
subgroup discovery
optimal solution
real world
information retrieval
feature selection
metadata
feature extraction
computational complexity
dynamic programming
globally consistent