Complexity of Boolean algebras
- 31 December 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 10 (3) , 221-247
- https://doi.org/10.1016/0304-3975(80)90048-1
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Rudimentary Predicates and Relative ComputationSIAM Journal on Computing, 1978
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- A Decision Procedure for the First Order Theory of Real Addition with OrderSIAM Journal on Computing, 1975
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960