Rational Constraints in Free Groups: A PSPACE-Complete Problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:1102:11, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,871 bytes +1,871‎ Created page with "Title: Rational Constraints in Free Groups: A PSPACE-Complete Problem Abstract: This research article explores the existential theory of equations with rational constraints in free groups. It presents an algorithm that works in polynomial space, even in the more general setting where each variable has a rational constraint. The main result states that the existential theory of equations in free groups with rational constraints is PSPACE-complete. This is achieved as a c..."
Retrieved from "https://simplesci.org/wiki/Rational_Constraints_in_Free_Groups:_A_PSPACE-Complete_Problem"