The Complexity of Logical Theories
暂无分享,去创建一个
[1] Leonard Berman,et al. Precise bounds for presburger arithmetic and the reals with addition: Preliminary report , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[2] M. Fischer,et al. SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC , 1974 .
[3] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.
[4] Larry Joseph Stockmeyer,et al. The complexity of decision problems in automata theory and logic , 1974 .
[5] Derek C. Oppen,et al. A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic , 1978, J. Comput. Syst. Sci..
[6] Jeanne Ferrante,et al. A Decision Procedure for the First Order Theory of Real Addition with Order , 1975, SIAM J. Comput..
[7] Albert R. Meyer,et al. On Time-Space Classes and their Relation to the Theory of Real Addition , 1980, Theor. Comput. Sci..