Tight conditional lower bounds for longest common increasing subsequence

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:	10.4230/LIPIcs.IPEC.2017.1
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; ; IPEC
affiliation:	Wydział Matematyki i Informatyki : Zespół Katedr i Zakładów Informatyki Matematycznej
type:	chapter
subtype:	conference proceedings