Abstract
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.
| Original language | English |
|---|---|
| Pages (from-to) | 250-258 |
| Number of pages | 9 |
| Journal | Mathematical Systems Theory |
| Volume | 47 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jul 2010 |
Keywords
- Equations over free groups
- NP-completeness