电邮这篇文章 Complexity of the Isomorphism Problem for Computable Free Projective Planes of Finite Rank
- 作者: Kogabaev N.T.1
-
隶属关系:
- Sobolev Institute of Mathematics
- 期: 卷 59, 编号 2 (2018)
- 页面: 295-308
- 栏目: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/171780
- DOI: https://doi.org/10.1134/S0037446618020131
- ID: 171780
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
Studying computable representations of projective planes, we prove that the isomorphism problem in the class of free projective planes of finite rank is an m-complete Δ03-set within the class.
作者简介
N. Kogabaev
Sobolev Institute of Mathematics
编辑信件的主要联系方式.
Email: kogabaev@math.nsc.ru
俄罗斯联邦, Novosibirsk
补充文件
