Double-exponential Complexity of Computing a Complete Set of AC-Unifiers
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
Double-exponential Complexity of Computing a Complete Set of AC-Unifiers
LICS, 1992.

LICS 1992
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{LICS-1992-KapurN,
	author        = "Deepak Kapur and Paliath Narendran",
	booktitle     = "{Proceedings of the Seventh Annual Symposium on Logic in Computer Science}",
	doi           = "10.1109/LICS.1992.185515",
	isbn          = "0-8186-2735-2",
	pages         = "11--21",
	publisher     = "{IEEE Computer Society}",
	title         = "{Double-exponential Complexity of Computing a Complete Set of AC-Unifiers}",
	year          = 1992,
}

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.