Author:
Hartmanis Juris,Immerman Neil
Reference5 articles.
1. Baker, T., J. Gill and R. Solovay. “Relativization of the P=?NP Question”. SIAM Journal of Computing (1975), 431–442.
2. Garey, M.R. and D.S. Johnson. “Computers and Intractability: A guide to the Theory of NP-Completeness”. W.H. Freeman and Co., San Francisco, 1979.
3. Kowalczyk, W. “Some Connections Between Representability of Complexity Classes and the Power of Formal Systems of Reasoning”. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 176. Springer-Verlag 1984, 364–369.
4. Rogers, J., Jr. “Theory of Recursive Functions and Effective Computability”. McGraw-Hill, New York, 1967.
5. Sipser, M. “On Relativization and the Existence of Complete Sets”. Automata Languages and Programming Lecture Notes in Computer Science 140. Springer-Verlag 1982, 523–531.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献