Complexity-theoretic algebra II: Boolean algebras
- 9 October 1989
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 44 (1-2) , 71-99
- https://doi.org/10.1016/0168-0072(89)90047-x
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- On splitting recursive setsJournal of Computer and System Sciences, 1978
- Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spacesThe Journal of Symbolic Logic, 1977
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Two notes on vector spaces with recursive operations.Notre Dame Journal of Formal Logic, 1971
- Classes of Recursively Enumerable Sets and Degrees of UnsolvabilityMathematical Logic Quarterly, 1966
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965