Unification Modulo Associativity and Idempotency Is NP-complete
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F02%3A00007266" target="_blank" >RIV/00216224:14310/02:00007266 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Unification Modulo Associativity and Idempotency Is NP-complete
Original language description
We show that the unification problem for the theory of one associative and idempotent function symbol (AI-unification), i.e. solving word equations in free idempotent semigroups, is NP-complete.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Mathematical Foundations of Computer Science 2002:27th International Symposium
ISBN
3-540-44040-2
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
423
Publisher name
Springer-Verlag
Place of publication
Berlin
Event location
26.-30.8.2002, Waraw, Poland
Event date
Jan 1, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—