A simplified proof of a lower complexity estimate

DOI10.1515/DMA-2013-010zbMath1317.94171OpenAlexW2332297027MaRDI QIDQ5396905

V. M. Khrapchenko

Publication date: 4 February 2014

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

Full work available at URL: https://doi.org/10.1515/dma-2013-010

zbMATH Keywords

lower complexity bound

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Related Items (3)

On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube ⋮ Unnamed Item ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO

This page was built for publication: A simplified proof of a lower complexity estimate