Recognition of functions invariant under Moebius transformation and even functions defined in polynomial form.

DOI10.1007/S10598-013-9198-6MaRDI QIDQ487196zbMATH OpenOpenAlexFDO

Authors Anton V. Bukhman

Publication date 19 January 2015

Published in Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10598-013-9198-6

zbMATH Keywords

Boolean functionspolynomial-time algorithmsefficient algorithmspolynomial functionsMoebius transformations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30)

Recommendations

• Certain problems associated with Boolean polynomials
• Symmetric polynomial-like Boolean functions
• On the computation of the Möbius transform
• Möbius transforms, coincident Boolean functions and non-coincidence property of Boolean functions
• Polynomial-like Boolean functions

Cited in

(2)

• Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials
• Möbius transforms, coincident Boolean functions and non-coincidence property of Boolean functions

This page was built for publication: Recognition of functions invariant under Moebius transformation and even functions defined in polynomial form.

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