Relativizations of the P = NP problem over the complex number field.
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] (2004)
- Volume: 1, page 91-98
- ISSN: 1813-3304
Access Full Article
top
How to cite
topRybalov, A.N.. "Relativizations of the P = NP problem over the complex number field.." Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] 1 (2004): 91-98. <http://eudml.org/doc/51957>.
@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 -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.