Corpus ID: 14457853

Frameworks for Solving Turing Kernel Lower Bound Problem and Finding Natural Candidate Problems in NP-intermediate

@article{Luo2016FrameworksFS,
  title={Frameworks for Solving Turing Kernel Lower Bound Problem and Finding Natural Candidate Problems in NP-intermediate},
  author={Weidong Luo},
  journal={arXiv: Computational Complexity},
  year={2016}
}
  • Weidong Luo
  • Published 2016
  • Computer Science
  • arXiv: Computational Complexity
  • Kernelization is a significant topic in parameterized complexity. Turing kernelization is a general form of kernelization. In the aspect of kernelization, an impressive hardness theory has been established [Bodlaender etc. (ICALP 2008, JCSS2009), Fortnow and Santhanam (STOC 2008, JCSS 2011), Dell and van Melkebeek (STOC 2010, J. ACM 2014), Drucker (FOCS 2012, SIAM J. Comput. 2015)], which can obtain lower bounds of kernel size. Unfortunately, there is yet no tool can prove Turing kernel lower… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 77 REFERENCES

    Recent developments in kernelization: A survey

    VIEW 2 EXCERPTS

    Lower Bounds for Kernelizations and Other Preprocessing Procedures

    VIEW 1 EXCERPT

    Kernelization of packing problems

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Incompressibility through Colors and IDs

    VIEW 1 EXCERPT