On the Computational Complexity of Finite Operations

DOI10.1142/S0129054116500027zbMath1347.08005arXiv1501.00265MaRDI QIDQ2806555

Ivo Damyanov, Slavcho Shtrakov

Publication date: 18 May 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.00265

zbMATH Keywords

implementationsubfunctionseparable setordered decision diagram

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30) Operations and polynomials in algebraic structures, primal algebras (08A40) Many-valued logic (03B50)

This page was built for publication: On the Computational Complexity of Finite Operations