Sciact
  • EN
  • RU

Bounded Reducibility for Computable Numberings Full article

Journal Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349
Output data Year: 2019, Pages: 96-107 Pages count : 12 DOI: 10.1007/978-3-030-22996-2_9
Authors Bazhenov Nikolay 1,2 , Mustafa Manat 3 , Ospichev Sergei 1,2
Affiliations
1 Sobolev Institute of Mathematics
2 Novosibirsk State University
3 Nazarbayev University
Cite: Bazhenov N. , Mustafa M. , Ospichev S.
Bounded Reducibility for Computable Numberings
Lecture Notes in Computer Science. 2019. P.96-107. DOI: 10.1007/978-3-030-22996-2_9 Scopus OpenAlex
Dates:
Published online: Jun 19, 2019
Identifiers:
Scopus: 2-s2.0-85069464896
OpenAlex: W2955275363
Citing:
DB Citing
OpenAlex 1
Altmetrics: