Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems
暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[2] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .
[3] J. Barwise. Admissible Sets and Structures: An Approach to Definability Theory , 1976 .
[4] Iain A. Stewart,et al. Comparing the Expressibility of Languages Formed using NP-Complete Operators , 1991, J. Log. Comput..
[5] Phokion G. Kolaitis,et al. Logical Definability of NP Optimization Problems , 1994, Inf. Comput..
[6] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .
[7] Desh Ranjan,et al. Quantifiers and Approximation , 1993, Theor. Comput. Sci..
[8] Phokion G. Kolaitis,et al. 0-1 laws and decision problems for fragments of second-order logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[9] Georg Gottlob,et al. Adding disjunction to datalog (extended abstract) , 1994, PODS.
[10] Daniel Leivant,et al. Descriptive Characterizations of Computational Complexity , 1989, J. Comput. Syst. Sci..
[11] Yuri Matiyasevich,et al. Hilbert’s tenth problem , 2019, 100 Years of Math Milestones.
[12] Richard M. Karp. Complexity of Computation , 1974 .
[13] Ronald Fagin. Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .
[14] Peter Buneman,et al. Semistructured data , 1997, PODS.