NP-Completeness of the Set Unification and Matching Problems
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Deepak Kapur, Paliath Narendran
NP-Completeness of the Set Unification and Matching Problems
CADE, 1986.

CADE 1986
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{CADE-1986-KapurN,
	author        = "Deepak Kapur and Paliath Narendran",
	booktitle     = "{Proceedings of the Eighth International Conference on Automated Deduction}",
	doi           = "10.1007/3-540-16780-3_113",
	isbn          = "3-540-16780-3",
	pages         = "489--495",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{NP-Completeness of the Set Unification and Matching Problems}",
	volume        = 230,
	year          = 1986,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.