电邮这篇文章 On quasi-universal word functions
- 作者: Osipov K.V.1
-
隶属关系:
- Department of Computational Mathematics and Cybernetics
- 期: 卷 40, 编号 1 (2016)
- 页面: 28-34
- 栏目: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176116
- DOI: https://doi.org/10.3103/S0278641916010040
- ID: 176116
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
A method for constructing quasi universal “simple form” functions in the class of word functions is proposed. The method is used to construct an explicit superposition basis in the class of functions that can be computed in polynomial time.
作者简介
K. Osipov
Department of Computational Mathematics and Cybernetics
编辑信件的主要联系方式.
Email: d503@acmer.me
俄罗斯联邦, Moscow, 119991
补充文件
