NP-Completeness of the Set Unification and Matching Problems.

Deepak Kapur, Paliath Narendran

Browse the full CADE paper archive.