On the computational complexity of problems related to distinguishability sets.

Markus Holzer Sebastian Jakobi

Published in: Inf. Comput. (2018)

Keyphrases

computational complexity
np complete
solving problems
multi agent
special case
closely related
computational efficiency
decision problems
problems involving
databases
neural network
genetic algorithm
computer vision
case study
np hard
main problems