Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121).

Martin Grohe Michal Koucký Rüdiger Reischuk Dieter van Melkebeek

Published in: Dagstuhl Reports (2011)

Keyphrases

computational complexity
np complete
decision problems
real time
continuous domains
databases
solving problems
computational cost
probabilistic model
problems involving
finite number
application domains
sufficient conditions
search space
multiscale
artificial intelligence
machine learning
data sets