Jagiellonian University Repository
Tight conditional lower bounds for longest common increasing subsequence
- DSpace Home
- →
- Bibliografia Publikacji Pracowników UJ
- →
- Publikacje naukowe
- →
- View Item
Tight conditional lower bounds for longest common ...
Bibliographic description
| title: | Tight conditional lower bounds for longest common increasing subsequence |
| author: | Duraj Lech  , Künnemann Marvin, Polak Adam
|
| editor: | Lokshtanov Daniel, Nishimura Naomi |
| Book title: | 12th International Symposium on Parameterized and Exact Computation : IPEC 2017, September 6-8, 2017, Vienna, Austria |
| date of publication: | 2018 |
| place of publication : name of publisher: |
Saarbrücken Wadern : Dagstuhl Publishing |
| pages: | 15:1-15:13 |
| ISBN: |
978-3-95977-051-4 |
| series: |
Leibniz International Proceedings in Informatics (LIPIcs), ISSN 1868-8969; 89 |
| DOI: | |
| language: | English |
| Book language: | English |
| keywords in english: | fine-grained complexity, combinatorial pattern matching, sequence alignments, parameterized complexity, SETH |
| Conference: | 12th International Symposium on Parameterized and Exact Computation IPEC; 2017-09-06; 2017-09-08; Wiedeń; Austria; ; indeksowana w Scopus; ; |
| affiliation: | Wydział Matematyki i Informatyki : Zespół Katedr i Zakładów Informatyki Matematycznej |
| type: | chapter |
| subtype: | conference proceedings |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Udzielam licencji. Uznanie autorstwa 3.0