<div class="csl-bib-body">
<div class="csl-entry">Brand, C., & Lassota, A. (2023). Fast Convolutions for Near-Convex Sequences. In S. Iwata & N. Kakimura (Eds.), <i>34th International Symposium on Algorithms and Computation (ISAAC 2023)</i> (pp. 1–16). Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2023.16</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/191157
-
dc.description.abstract
We develop algorithms for (min,+)-Convolution and related convolution problems such as Super Additivity Testing, Convolution 3-Sum and Minimum Consecutive Subsums which use the degree of convexity of the instance as a parameter. Assuming the min-plus conjecture (Künnemann-Paturi-Schneider, ICALP'17 and Cygan et al., ICALP'17), our results interpolate in an optimal manner between fully convex instances, which can be solved in near-linear time using Legendre transformations, and general non-convex sequences, where the trivial quadratic-time algorithm is conjectured to be best possible, up to subpolynomial factors.
en
dc.language.iso
en
-
dc.relation.ispartofseries
Leibniz International Proceedings in Informatics (LIPIcs)
-
dc.subject
fine-grained complexity
en
dc.subject
convex sequences
en
dc.subject
(min, +)-convolution
en
dc.title
Fast Convolutions for Near-Convex Sequences
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.contributor.affiliation
Max Planck Institute for Informatics, Germany
-
dc.relation.isbn
978-3-95977-289-1
-
dc.description.startpage
1
-
dc.description.endpage
16
-
dc.type.category
Full-Paper Contribution
-
dc.relation.eissn
1868-8969
-
tuw.booktitle
34th International Symposium on Algorithms and Computation (ISAAC 2023)
-
tuw.container.volume
283
-
tuw.peerreviewed
true
-
tuw.relation.publisher
Schloss-Dagstuhl - Leibniz Zentrum für Informatik
-
tuw.book.chapter
16
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publisher.doi
10.4230/LIPICS.ISAAC.2023.16
-
dc.description.numberOfPages
16
-
tuw.author.orcid
0000-0001-6215-066X
-
tuw.editor.orcid
0000-0002-3918-3479
-
tuw.event.name
34th International Symposium on Algorithms and Computation (ISAAC 2023)
en
tuw.event.startdate
03-12-2023
-
tuw.event.enddate
06-12-2023
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Kyoto
-
tuw.event.country
JP
-
tuw.event.presenter
Brand, Cornelius
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.languageiso639-1
en
-
item.fulltext
no Fulltext
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.grantfulltext
none
-
item.cerifentitytype
Publications
-
item.openairetype
conference paper
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity