Wojciech Plandowski
Satisfiability of Word Equations with Constants is in NEXPTIME
STOC, 1999.
@inproceedings{STOC-1999-Plandowski,
author = "Wojciech Plandowski",
booktitle = "{Proceedings of the 31st Annual ACM Symposium on Theory of Computing}",
doi = "10.1145/301250.301443",
isbn = "1-58113-067-8",
pages = "721--725",
publisher = "{ACM}",
title = "{Satisfiability of Word Equations with Constants is in NEXPTIME}",
year = 1999,
}











