Login / Signup
Exploring the Subexponential Complexity of Completion Problems.
Pål Grønås Drange
Fedor V. Fomin
Michal Pilipczuk
Yngve Villanger
Published in:
ACM Trans. Comput. Theory (2015)
Keyphrases
</>
decision problems
np complete
difficult problems
problems involving
tractable cases
decision trees
case study
np hardness
data structure
optimization problems
linear programming
computational issues
related problems
application domains
real time
multi agent systems
multiscale
information retrieval
databases