On the upper bounds for complexities of discrete functions

DOI10.1142/S1793557122501790OpenAlexW4206535901MaRDI QIDQ5876808

Slavcho Shtrakov

Publication date: 2 February 2023

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557122501790

zbMATH Keywords

identification minorsubfunctionseparable setminor complexityminor decision diagram

Mathematics Subject Classification ID

Boolean functions (06E30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Essential arities of term operations in finite algebras
• Parametrized arity gap
• On finite functions with non-trivial arity gap
• Graph-Based Algorithms for Boolean Function Manipulation
• Essential Variables and Separable Sets in Universal Algebra

This page was built for publication: On the upper bounds for complexities of discrete functions