Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{208651,
author = {Klíma, Ondřej and Srba, Jiří},
address = {Berlin},
booktitle = {Mathematical Foundation of Computer Science 2000, 25th International Symposium},
language = {eng},
location = {Berlin},
isbn = {3-540-67901-4},
pages = {456-466},
publisher = {Springer-Verlag},
title = {Matching Modulo Associativity and Idempotency is NP-Complete},
year = {2000}
}
TY - JOUR
ID - 208651
AU - Klíma, Ondřej - Srba, Jiří
PY - 2000
TI - Matching Modulo Associativity and Idempotency is NP-Complete
VL - Lecture Notes in Computer Science, 1893
PB - Springer-Verlag
CY - Berlin
SN - 3540679014
N2 - We show that AI-matching (AI denotes the theory of an associative and idempotent function symbol), which is solving matching word equations in free idempotent semigroups, is NP-complete.
ER -
KLÍMA, Ondřej a Jiří SRBA. Matching Modulo Associativity and Idempotency is NP-Complete. In \textit{Mathematical Foundation of Computer Science 2000, 25th International Symposium}. Berlin: Springer-Verlag, 2000, s.~456-466. Lecture Notes in Computer Science, 1893. ISBN~3-540-67901-4.
|
