Skip to main content
Conference Proceedings

A new quasi-reducibility testing algorithm and its application to proofs by induction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 343 LNCS 204-213
DOI: 10.1007/3-540-50667-5_72
7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Kucherov, G. A. (1988). A new quasi-reducibility testing algorithm and its application to proofs by induction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 343 LNCS, pp. 204–213). Springer Verlag. https://doi.org/10.1007/3-540-50667-5_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free