Is First Order Contained in an Initial Segment of PTIME?
暂无分享,去创建一个
[1] Alfred V. Aho,et al. Universality of data retrieval languages , 1979, POPL.
[2] Neil Immerman,et al. Relational queries computable in polynomial time (Extended Abstract) , 1982, STOC '82.
[3] David Harel,et al. Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..
[4] H. Bedmann,et al. Beiträge zur Algebra der Logik, insbesondere zum Entscheidungsproblem , 1922 .
[5] Martin Grohe. Bounded-Arity Hierarchies in Fixed-Point Logics , 1993, CSL.
[6] Phokion G. Kolaitis. Implicit definability on finite structures and unambiguous computations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.
[7] Vladimir Yu. Sazonov. Polynomial Computability and Recursivity in Finite Domains , 1980, J. Inf. Process. Cybern..
[8] Leslie G. Valiant,et al. Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..
[9] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[10] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.
[11] Yuri Gurevich,et al. Algebras of feasible functions , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[12] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[13] Neil Immerman,et al. Languages that Capture Complexity Classes , 1987, SIAM J. Comput..
[14] David Harel,et al. Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[15] Yiannis N. Moschovakis,et al. Elementary induction on abstract structures , 1974 .
[16] Herbert B. Enderton,et al. A mathematical introduction to logic , 1972 .