Sufficient-completeness, ground-reducibility and their...

Acta Informatica 1991 / 04 Vol. 28; Iss. 4

Sufficient-completeness, ground-reducibility and their complexity

Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
28
Language:
english
Pages:
40
DOI:
10.1007/bf01893885
Date:
April, 1991
File:
PDF, 2.16 MB
english, 1991
Conversion to is in progress
Conversion to is failed