On almost bad Boolean bases
From MaRDI portal
Publication:1349706
DOI10.1016/0304-3975(94)00048-NzbMath0874.68268OpenAlexW1978985932MaRDI QIDQ1349706
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00048-n
Related Items (3)
Using relevance queries for identification of read-once functions ⋮ Linear read-once and related Boolean functions ⋮ Critical properties and complexity measures of read-once Boolean functions
Cites Work
- The monotone circuit complexity of Boolean functions
- A method for obtaining more than quadratic effective lower estimates of complexity of \(\pi\) schemes
- Complexity of the realization of a linear function in the class of \(\Pi\)-circuits
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On almost bad Boolean bases
