Lower estimates of circuit complexity in the basis of antichain functions

DOI10.3103/S0027132213020046zbMath1298.68104OpenAlexW1975727709MaRDI QIDQ355314

Olga V. Podolskaya

Publication date: 24 July 2013

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132213020046

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Combinatorial probability (60C99)

Cites Work

• On the complexity of schemes in an infinite basis
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower estimates of circuit complexity in the basis of antichain functions