Inproceedings,

Monadic Second-Order Unification Is NP-Complete.

, , and .
RTA, volume 3091 of Lecture Notes in Computer Science, page 55-69. Springer, (2004)

Meta data

Tags

Users

  • @dblp

Comments and Reviews