arXiv (All)
open access
Quadratic Word Equations with a Linear Side: Polynomial Nielsen Graph Diameter and NP-Completeness
The satisfiability problem for word equations asks whether variables can be replaced by words so that the two sides become equal. For regular word equations, in which each variable occurs at most once on each side, satisfiability is NP-complete. For general quadratic word equations, in which each va
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Standard Quadratic Formulations of Many NP Problems: A Simplex-Based Compilation Framework for Combinatorial Optimization#1157182
- (MPO)$^2$: Multivariate Polynomial Optimization based on Matrix Product Operators#381752
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization#955121
- Singular difference graphs of vector spaces of square matrices#792441
- Singular difference graphs of vector spaces of square matrices#788441
Record · ID 1049993
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive