On the Equivalence among Problems of Bounded Width

    European Symposium on Algorithms, pp. 754-765, 2015.

    Cited by: 4|Bibtex|Views0|Links
    EI

    Abstract:

    In this paper, we introduce a methodology, called decomposition-based reductions, for showing the equivalence among various problems of bounded-width. First, we show that the following are equivalent for any $\alpha > 0$: * SAT can be solved in $O^*(2^{\alpha \mathrm{tw}})$ time, * 3-SAT can be solved in $O^*(2^{\alpha \mathrm{tw}...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments