On the Complexity of Hard Enumeration Problems.

Nadia Creignou Markus Kröll Reinhard Pichler Sebastian Skritek Heribert Vollmer

Published in: LATA (2017)

Keyphrases

decision problems
similarity measure
application domains
problems involving
polynomial hierarchy
neural network
np hardness
database
data sets
databases
optimization problems
space complexity
solving problems
related problems
computationally hard
complexity bounds