Relativizations of the P = NP problem over the complex number field.

@article{Rybalov2004,
author = {Rybalov, A.N.},
journal = {Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]},
keywords = {complexity over structures; digital nondeterminism; theory of computation; recursive function; generalized computability},
language = {eng},
pages = {91-98},
publisher = {Institut Matematiki Im. S.L. Soboleva, SO RAN},
title = {Relativizations of the P = NP problem over the complex number field.},
url = {http://eudml.org/doc/51957},
volume = {1},
year = {2004},
}

TY - JOUR
AU - Rybalov, A.N.
TI - Relativizations of the P = NP problem over the complex number field.
JO - Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
PY - 2004
PB - Institut Matematiki Im. S.L. Soboleva, SO RAN
VL - 1
SP - 91
EP - 98
LA - eng
KW - complexity over structures; digital nondeterminism; theory of computation; recursive function; generalized computability
UR - http://eudml.org/doc/51957
ER -