On the Power of Tree-Depth for Fully Polynomial FPT Algorithms

    Tomoaki Ogasawara
    Tomoaki Ogasawara

    symposium on theoretical aspects of computer science, 2018.

    Cited by: 10|Bibtex|Views3|Links
    EI

    Abstract:

    There are many classical problems in whose time complexities have not been improved over the past decades.Recent studies of Hardness in P have revealed that, for several of such problems, the current fastest algorithm is the best possible under some complexity assumptions.To bypass this difficulty, the concept of inside P has been intro...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments