Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

MFCS
2000
Springer

favoriteEmaildiscussreport

79views Theoretical Computer Science» more MFCS 2000»

Matching Modulo Associativity and Idempotency Is NP-Complete

13 years 8 months ago

Matching Modulo Associativity and Idempotency Is NP-Complete

Download www.daimi.au.dk

We show that AI

Ondrej Klíma, Jirí Srba

Real-time Traffic

Free Idempotent Semigroups | Idempotent Function Symbol | MFCS 2000 | Theoretical Computer Science | Word Equations |

claim paper

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	MFCS
Authors	Ondrej Klíma, Jirí Srba

Comments (0)