Recompression
From MaRDI portal
Publication:3177761
DOI10.1145/2743014zbMath1403.68374OpenAlexW2161510308MaRDI QIDQ3177761
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2743014
Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items (19)
The Diophantine problem in the classical matrix groups ⋮ The complexity of solution sets to equations in hyperbolic groups ⋮ Approximation of smallest linear tree grammar ⋮ Finding all solutions of equations in free groups and monoids with involution ⋮ Word equations in the context of string solving ⋮ Equations over free inverse monoids with idempotent variables ⋮ Word equations in synergy with regular constraints ⋮ Solutions to twisted word equations and equations in virtually free groups ⋮ Word equations in non-deterministic linear space ⋮ On the Complexity of Solving Restricted Word Equations ⋮ Unnamed Item ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ Internal dictionary matching ⋮ Unnamed Item ⋮ On the Solvability Problem for Restricted Classes of Word Equations ⋮ Solution sets for equations over free groups are EDT0L languages ⋮ The hardness of solving simple word equations ⋮ On PSPACE generation of a solution set of a word equation and its applications ⋮ Diophantine problems in solvable groups
This page was built for publication: Recompression
