Matches in SemOpenAlex for { <https://semopenalex.org/work/W3196804066> ?p ?o ?g. }
Showing items 1 to 71 of
71
with 100 items per page.
- W3196804066 startingPage "19" @default.
- W3196804066 abstract "We prove 3SUM-hardness (no strongly subquadratic-time algorithm, assuming the 3SUM conjecture) of several problems related to finding Abelian square and additive square factors in a string. In particular, we conclude conditional optimality of the state-of-the-art algorithms for finding such factors. Overall, we show 3SUM-hardness of (a) detecting an Abelian square factor of an odd half-length, (b) computing centers of all Abelian square factors, (c) detecting an additive square factor in a length-n string of integers of magnitude n^{𝒪(1)}, and (d) a problem of computing a double 3-term arithmetic progression (i.e., finding indices i ≠ j such that (x_i+x_j)/2 = x_{(i+j)/2}) in a sequence of integers x₁,… ,x_n of magnitude n^{𝒪(1)}.Problem (d) is essentially a convolution version of the AVERAGE problem that was proposed in a manuscript of Erickson. We obtain a conditional lower bound for it with the aid of techniques recently developed by Dudek et al. [STOC 2020]. Problem (d) immediately reduces to problem (c) and is a step in reductions to problems (a) and (b). In conditional lower bounds for problems (a) and (b) we apply an encoding of Amir et al. [ICALP 2014] and extend it using several string gadgets that include arbitrarily long Abelian-square-free strings.Our reductions also imply conditional lower bounds for detecting Abelian squares in strings over a constant-sized alphabet. We also show a subquadratic upper bound in this case, applying a result of Chan and Lewenstein [STOC 2015]." @default.
- W3196804066 created "2021-09-13" @default.
- W3196804066 creator A5061843884 @default.
- W3196804066 creator A5079957387 @default.
- W3196804066 creator A5082711976 @default.
- W3196804066 creator A5083139616 @default.
- W3196804066 creator A5090363120 @default.
- W3196804066 date "2021-07-20" @default.
- W3196804066 modified "2023-09-27" @default.
- W3196804066 title "Hardness of Detecting Abelian and Additive Square Factors in Strings" @default.
- W3196804066 doi "https://doi.org/10.4230/lipics.esa.2021.77" @default.
- W3196804066 hasPublicationYear "2021" @default.
- W3196804066 type Work @default.
- W3196804066 sameAs 3196804066 @default.
- W3196804066 citedByCount "0" @default.
- W3196804066 crossrefType "proceedings-article" @default.
- W3196804066 hasAuthorship W3196804066A5061843884 @default.
- W3196804066 hasAuthorship W3196804066A5079957387 @default.
- W3196804066 hasAuthorship W3196804066A5082711976 @default.
- W3196804066 hasAuthorship W3196804066A5083139616 @default.
- W3196804066 hasAuthorship W3196804066A5090363120 @default.
- W3196804066 hasConcept C114614502 @default.
- W3196804066 hasConcept C118615104 @default.
- W3196804066 hasConcept C134306372 @default.
- W3196804066 hasConcept C135692309 @default.
- W3196804066 hasConcept C136170076 @default.
- W3196804066 hasConcept C157486923 @default.
- W3196804066 hasConcept C2524010 @default.
- W3196804066 hasConcept C2780990831 @default.
- W3196804066 hasConcept C33923547 @default.
- W3196804066 hasConcept C37914503 @default.
- W3196804066 hasConcept C77553402 @default.
- W3196804066 hasConceptScore W3196804066C114614502 @default.
- W3196804066 hasConceptScore W3196804066C118615104 @default.
- W3196804066 hasConceptScore W3196804066C134306372 @default.
- W3196804066 hasConceptScore W3196804066C135692309 @default.
- W3196804066 hasConceptScore W3196804066C136170076 @default.
- W3196804066 hasConceptScore W3196804066C157486923 @default.
- W3196804066 hasConceptScore W3196804066C2524010 @default.
- W3196804066 hasConceptScore W3196804066C2780990831 @default.
- W3196804066 hasConceptScore W3196804066C33923547 @default.
- W3196804066 hasConceptScore W3196804066C37914503 @default.
- W3196804066 hasConceptScore W3196804066C77553402 @default.
- W3196804066 hasLocation W31968040661 @default.
- W3196804066 hasOpenAccess W3196804066 @default.
- W3196804066 hasPrimaryLocation W31968040661 @default.
- W3196804066 hasRelatedWork W1508725836 @default.
- W3196804066 hasRelatedWork W1643558380 @default.
- W3196804066 hasRelatedWork W1996947585 @default.
- W3196804066 hasRelatedWork W1997575430 @default.
- W3196804066 hasRelatedWork W2064584528 @default.
- W3196804066 hasRelatedWork W2092016058 @default.
- W3196804066 hasRelatedWork W2529988950 @default.
- W3196804066 hasRelatedWork W2806100743 @default.
- W3196804066 hasRelatedWork W2900615342 @default.
- W3196804066 hasRelatedWork W2937819376 @default.
- W3196804066 hasRelatedWork W2963488736 @default.
- W3196804066 hasRelatedWork W3041151068 @default.
- W3196804066 hasRelatedWork W3083750962 @default.
- W3196804066 hasRelatedWork W3095889816 @default.
- W3196804066 hasRelatedWork W3100691122 @default.
- W3196804066 hasRelatedWork W3117839115 @default.
- W3196804066 hasRelatedWork W3168912476 @default.
- W3196804066 hasRelatedWork W3183682236 @default.
- W3196804066 hasRelatedWork W3197412015 @default.
- W3196804066 hasRelatedWork W65722314 @default.
- W3196804066 isParatext "false" @default.
- W3196804066 isRetracted "false" @default.
- W3196804066 magId "3196804066" @default.
- W3196804066 workType "article" @default.