Bounds for the average-case complexity of monotone Boolean functions

DOI10.1515/DMA-2017-0017zbMath1422.68107OpenAlexW2724366454MaRDI QIDQ1675542

Aleksandr V. Chashkin

Publication date: 2 November 2017

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2017-0017

zbMATH Keywords

monotone Boolean functionsaverage-case complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

On the implementation of monotone Boolean functions by memoryless programs

Cites Work

• Unnamed Item
• Unnamed Item
• Average time of computing Boolean operators
• On the mean complexity of monotone functions

This page was built for publication: Bounds for the average-case complexity of monotone Boolean functions