6 search results - page 2 / 2 » On the complexity of the multicut problem in bounded tree-wi... |
ECCC
2006
13 years 5 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...