Problem of checking the functional completeness in the class of piecewise parallel functions

DOI10.3103/S0027132208060041MaRDI QIDQ2513031zbMATH OpenFDO

Authors V. S. Polovnikov

Publication date 2 February 2015

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S0027132208060041

Mathematics Subject Classification ID

Operations and polynomials in algebraic structures, primal algebras (08A40)

Recommendations

• scientific article; zbMATH DE number 7300329
• Computing and Combinatorics
• scientific article; zbMATH DE number 4205977
• The parallel complexity of function approximation
• Functional aspects of the completeness problem for some classes of automaton functions
• Completeness problems in classes of computable named functions
• On parallel complexity of analytic functions
• scientific article; zbMATH DE number 784042
• Functionals computable in series and in parallel

Cites work

• Some characteristics of neural networks

Cited in

(1)

• A criterion of expressibility of CPL functions in generalized bases

This page was built for publication: Problem of checking the functional completeness in the class of piecewise parallel functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513031)