Satisfiability of word equations with constants is in NEXPTIME
Wojciech Plandowski · 1999
Article Satisfiability of word equations with constants is in NEXPTIME Share on Author: Wojciech Plandowski Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warsaw, PolandView Profile Authors Info & Claims STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of ComputingMay 1999 Pages 721–725https://doi.org/10.1145/301250.301443Published:01 May 1999 32citation300DownloadsMetricsTotal Citations32Total Downloads300Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access