当前位置: X-MOL 学术Moscow Univ. Comput. Math. Cybern. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Completeness Criterion in Class of Exponential-Polynomial Functions
Moscow University Computational Mathematics and Cybernetics Pub Date : 2020-07-26 , DOI: 10.3103/s0278641920010070
S. S. Marchenkov

Abstract

The class \(\textrm{EP}_{\mathbb{N}}\) of all exponential-polynomial functions that can be obtained from the functions \(0,1,x+y,x\cdot y,\) and \(x^{y}\) by arbitrary superpositions is considered. In \(\textrm{EP}_{\mathbb{N}}\), six precomplete (with respect to the superposition operation) classes are efficiently defined so that a completeness criterion and a recognition algorithm for completeness are formulated in their base for finite systems of functions.


中文翻译:

一类指数多项式函数的完备性判据

摘要

所有指数多项式函数的类\(\ textrm {EP} _ {\ mathbb {N}} \)可以从函数\(0,1,x + y,x \ cdot y,\)\(x ^ {y} \)被认为是任意叠加。在\(\ textrm {EP} _ {\ mathbb {N}} \)中,有效地定义了六个预完成(相对于叠加操作)类,以便在其基础上制定完整性准则和用于完整性的识别算法,以用于功能的有限系统。
更新日期:2020-07-26
down
wechat
bug