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

zbMath1079.03033MaRDI QIDQ2575544

Alexander N. Rybalov

Publication date: 12 December 2005

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51957

zbMATH Keywords

theory of computationrecursive functiongeneralized computabilitycomplexity over structuresdigital nondeterminism

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

This page was built for publication: Relativizations of the P = NP problem over the complex number field