2010/10/01 by Sergey Volkov · 1 citation
Mathematics · Computer Science · #Advanced Optimization Algorithms Research #Matrix Theory and Algorithms #Polynomial and algebraic computation
paper · doi:10.1134/s1990478910040149
openalex publication_date 2010/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2025/11/06
Under consideration are some equivalent definitions of the class of Skolemelementary functions (analogous to the known definitions of the class of Kalmar elementary functions) and some results for this class obtained by various mathematicians. The definitions of this class were studied independently of each other, and their equivalence is proved in this paper. The question is studied of the existence of finite superposition bases in this class. We prove that the problem of the existence of such a basis amounts to the well-known problem from the theory of computational complexity.