Email this article On quasi-universal word functions
- Authors: Osipov K.V.1
-
Affiliations:
- Department of Computational Mathematics and Cybernetics
- Issue: Vol 40, No 1 (2016)
- Pages: 28-34
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176116
- DOI: https://doi.org/10.3103/S0278641916010040
- ID: 176116
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
Keywords
About the authors
K. V. Osipov
Department of Computational Mathematics and Cybernetics
Author for correspondence.
Email: d503@acmer.me
Russian Federation, Moscow, 119991
Supplementary files
