The complete classification for quantified equality constraints
share
We prove that QCSP(ℕ;x=y→ y=z) is PSpace-complete, settling a question open for more than ten years. This completes the complexity classification for quantified equality languages as a trichotomy between Logspace, NP-complete and PSpace-complete.
READ FULL TEXT