Author:
Anderaa Stal O.,B�rger Egon
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference9 articles.
1. Aanderaa, A.O.: On the decision problem for formulas in which all disjunctions are binary. Proc. of the Second Scand. Log. Symp. Amsterdam: North Holland pp. 1?18 (1971)
2. Börger, E.: Reduktionstypen in Krom- und Hornformeln. Dissertation, Münster. Arch. Math. Logik Grundlagenforsch. 16, 67?84 (1974)
3. Cook, S.A.: The complexity of theorem proving procedure. Conf. Rec. of 3rd ACM Symp. on Theory of Computing 151?158 (1970)
4. Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time. Theor. Comput. Sci. 3, 105?117 (1977)
5. Schnorr, C.P.: Rekursive Funktionen und ihre Komplexität. Stuttgart: Teubner (1974)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献