pith. sign in

Tight Hardness Results for

Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams , BookTitle = · 2015 · DOI 10.1109/focs.2015.14

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

fields

cs.DS 1 math.CO 1

years

2026 2

verdicts

ACCEPT 1 UNVERDICTED 1

clear filters

representative citing papers

Relaxation of Square-Freeness

math.CO · 2026-07-01 · unverdicted · novelty 5.0

Constructs infinite 3⁺-parameterized-square-free ternary words and 3⁺-order-preserving-square-free binary words via morphic substitutions, plus reports longest finite ℓ⁺-square-free words under several equivalences.

citing papers explorer

Showing 2 of 2 citing papers after filters.

  • Tractable Gap-Constraint Languages for Complex Event Recognition cs.DS · 2026-06-17 · accept · none · ref 1

    Subsequence matching with gap-constraints is solvable in O(|D|(|u| + |C|)) time under left-convexity of the languages, optimal under SETH.

  • Relaxation of Square-Freeness math.CO · 2026-07-01 · unverdicted · none · ref 21

    Constructs infinite 3⁺-parameterized-square-free ternary words and 3⁺-order-preserving-square-free binary words via morphic substitutions, plus reports longest finite ℓ⁺-square-free words under several equivalences.