A Completeness Theory for Polynomial (Turing) Kernelization

Hermelin, Danny; Kratsch, Stefan; Soltys, Karolina; Wahlström, Magnus; Wu, Xi

doi:10.1007/s00453-014-9910-8

Local TagsRelease HistoryDetailsSummary

A Completeness Theory for Polynomial (Turing) Kernelization

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0026-A0CF-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0026-A0D0-9

Genre: Journal Article

Latex : A Completeness Theory for Polynomial ({Turing}) Kernelization

Files

show Files

Locators

show

Creators

show

hide

Creators:
Hermelin, Danny¹, Author
Kratsch, Stefan¹, Author
Soltys, Karolina², Author
Wahlström, Magnus¹, Author
Wu, Xi², Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2015Date issued: 2015

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1007/s00453-014-9910-8
BibTex Citekey: HermlinAlgorithmica2015

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Algorithmica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: New York, NY : Springer

Pages: - Volume / Issue: 71 (3) Sequence Number: - Start / End Page: 702 - 730 Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793