The algorithm for completeness recognizing in function algebra L(Z)

DOI10.1515/DMA-2014-0003MaRDI QIDQ2344101zbMATH OpenOpenAlexFDO

Authors Andrei I. Mamontov, Dmitry G. Meshchaninov

Publication date 12 May 2015

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2014-0003

zbMATH Keywords

completenesscomputational complexityfunction algebrapolynomials over integers

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1166297
• scientific article; zbMATH DE number 3988715
• scientific article; zbMATH DE number 2099552
• On the complexity of completeness recognition of systems of Boolean functions realized in the form of Zhegalkin polynomials
• The completeness problem in the class of polynomials is resolvable

Cited in

(9)

• Closed classes of polynomials modulo p^2
• Completeness criterion in class of exponential-polynomial functions
• The completeness problem in the function algebra of linear integer-coefficient polynomials
• Procedures for polynomial and rational function recognition
• scientific article; zbMATH DE number 1166297 (Why is no real title available?)
• scientific article; zbMATH DE number 1567883 (Why is no real title available?)
• scientific article; zbMATH DE number 1892907 (Why is no real title available?)
• scientific article; zbMATH DE number 2099552 (Why is no real title available?)
• On the equality problem of finitely generated classes of exponentially-polynomial functions

This page was built for publication: The algorithm for completeness recognizing in function algebra \(L(\mathbb{Z})\)

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