On the P-NP problem over real matrix rings

Theoretical Computer Science

Volumn 314, Issue 1-2, 2004, Pages 281-285

  Rybalov, A ^a,b  

^a OMSK STATE UNIVERSITY   (Russian Federation)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Blum Shub Smale model; Matrix ring; Polynomial complexity classes

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

BLUM-SHUB-SMALE MODELS; MATRIX RING; POLYNOMIAL COMPLEXITY CLASSES;

COMPUTATIONAL COMPLEXITY;

EID: 84983722938     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.11.022     Document Type: Article

References (9)

1. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1998;Springer, Berlin.
2. Blum L., Shub M., Smale S. On a theory of computation and complexity over the real numbers. NP-completeness, recursive functions and universal machines Bull. Amer. Math. Soc. 21:1989;1-46.
3. Cucker F., Matamala M. On digital nondeterminism. Math. Systems Theory. 29:1996;635-647.
4. Gaßner C. The P-DNP problem for infinite abelian groups. J. Complexity. 17:2001;574-583.
5. Hemmerling A. Computability and complexity over structures. Math. Logic Quart. 44(1):1998;1-44.
6. Koiran P. Computing over the reals with addition and order. Theoret. Comput. Sci. 133:1994;35-47.
7. Meer K. A note on. P≠ NP -result for a restricted class of real machines J. Complexity. 8:1992;451-453.
8. Prunescu M. A model-theoretic proof of. P≠ NP over all infinite abelian groups J. Symbolic Logic. 67(1):2002;235-238.
9. Prunescu M. P≠ NP for all infinite Boolean algebras Math. Logic Quart. 49(2):2003;210-213.