One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
Open Access
PDF Availablehttps://doi.org/10.7146/brics.v7i13.20140
Copy DOI
Export
Save
Share
Cite Journal: BRICS Report Series |  Publication Date: Jan 13, 2000 |
 License type: cc-by-nc-nd |
We show that AI-matching (AI denotes the theory of an<br />associative and idempotent function symbol), which is solving matching<br />word equations in free idempotent semigroups, is NP-complete.<br />Note: this is a full version of the paper [9] and a revision of [8].
Free) Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
