Quadratic word equations
From MaRDI portal
Recommendations
Cited in
(17)- On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note)
- A polynomial bound on solutions of quadratic equations in free groups.
- Satisfiability of word equations with constants is in NEXPTIME
- Asymptotic invariants, complexity of groups and related problems.
- On quadratic word equations
- On the complexity of solving restricted word equations
- Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
- The hardness of solving simple word equations
- Tracing compressed curves in triangulated surfaces
- Languages generated by conjunctive query fragments of FC[REG]
- Constrained inhomogeneous spherical equations: average-case hardness
- On the structure of solution-sets to regular word equations
- Languages generated by conjunctive query fragments of FC[REG]
- Orientable quadratic equations in wreath products of abelian groups
- Quadratic equations in the lamplighter group
- Word equations with length constraints via weak arithmetics and matrix reachability problems
- The solvability problem for quadratic equations over free groups is NP-complete
This page was built for publication: Quadratic word equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941171)
