On the Structure of NP_C
暂无分享,去创建一个
[1] Uwe Schöning. A Uniform Approach to Obtain Diagonal Sets in Complexity Classes , 1982, Theor. Comput. Sci..
[2] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.
[3] André Galligo,et al. Some New Effectivity Bounds in Computational Geometry , 1988, AAECC.
[4] Richard E. Ladner,et al. On the Structure of Polynomial Time Reducibility , 1975, JACM.
[5] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .
[6] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[7] D. Grigor'ev,et al. THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS , 1987 .
[8] C. Michaux,et al. A survey on real structural complexity theory , 1997 .