Subtractive reductions and complete problems for counting complexity classes.

Arnaud Durand Miki Hermann Phokion G. Kolaitis

Published in: Theor. Comput. Sci. (2005)

Keyphrases

tractable cases
np complete
solving problems
decision problems
problems involving
binary classification problems
case study
reinforcement learning
computational complexity
optimization problems
semi supervised
data sets
class labels
space complexity
decision trees
polynomial hierarchy
neural network