Resolution cannot polynomially simulate compressed-BFS.

DoRon B. Motter Jarrod A. Roy Igor L. Markov

Published in: Ann. Math. Artif. Intell. (2005)

Keyphrases

data structure
breadth first search
high resolution
np complete
low resolution
data sets
multiscale
objective function
special case
data compression
search tree
pac learning
compressed data
consequence finding
conflict detection