A note on complete sets and transitive closure
- 1 December 1981
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 15 (1) , 311-313
- https://doi.org/10.1007/bf01786987
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Polynomial Space and Transitive ClosureSIAM Journal on Computing, 1979
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- On the power of multiplication in random access machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Classes of automata and transitive closureInformation and Control, 1968