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

DOI10.1007/S10598-013-9198-6zbMATH Open1304.06005OpenAlexW1964946323MaRDI QIDQ487196FDOQ487196

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)

Cites Work

• Title not available (Why is that?)

Cited In (1)

• Polynomial-time algorithms for checking some properties of Boolean functions given by polynomials

   Recommendations

• Certain problems associated with Boolean polynomials 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)