FINITE LANGUAGES AND THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC STRUCTURES

Publisher Website

1 January 1983

book chapter
Published by Elsevier

p. 333-355
https://doi.org/10.1016/b978-0-12-198820-3.50023-1

Abstract

No abstract available

This publication has 2 references indexed in Scilit:

Regular Algebra Applied to Path-finding Problems
IMA Journal of Applied Mathematics, 1975
The complexity of theorem-proving procedures
Published by Association for Computing Machinery (ACM) ,1971