Sciweavers

80
Voted
MFCS
2000
Springer
15 years 1 months ago
Matching Modulo Associativity and Idempotency Is NP-Complete
We show that AI
Ondrej Klíma, Jirí Srba