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

DOI10.1007/s10598-013-9198-6zbMath1304.06005OpenAlexW1964946323MaRDI QIDQ487196

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 functionspolynomial-time algorithmsefficient algorithmsMoebius transformations

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item

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