Searching for "Double-exponential Complexity of Computing a Complete Set of AC-Unifiers" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Double-Exponential Complexity of Computing a Complete Set of AC-Unifiers
by Deepak Kapur, Paliath Narendran — In Proceedings 7th IEEE Symposium on Logic in Computer Science
…DOUBLE-EXPONENTIAL COMPLEXITY OF COMPUTING A COMPLETE SET OF AC-UNIFIERS (Preliminary Report…
Cited by 17 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB