English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

A Completeness Theory for Polynomial (Turing) Kernelization

MPS-Authors
/persons/resource/persons44612

Hermelin,  Danny
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44840

Kratsch,  Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45687

Wahlström,  Magnus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Hermelin, D., Kratsch, S., Soltys, K., Wahlström, M., & Wu, X. (2015). A Completeness Theory for Polynomial (Turing) Kernelization. Algorithmica, 71(3), 702-730. doi:10.1007/s00453-014-9910-8.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0026-A0CF-F
Abstract
There is no abstract available