scientific article; zbMATH DE number 7656037
From MaRDI portal
Publication:5878634
DOI10.33048/daio.2022.29.751MaRDI QIDQ5878634
Publication date: 21 February 2023
Full work available at URL: http://mathnet.ru/eng/da1310
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boolean functionminimal formulalower bound for complexity\( \Pi \)-partition\( \Pi \)-schemenormalized formularepresentation of formula
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on the formula complexity of a linear Boolean function
- Formula complexity of a linear function in a \(k\)-ary basis
- Complexity of the realization of a linear function in the class of \(\Pi\)-circuits
- Method of determining lower bounds for the complexity of \(\Pi\)-circuits
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions
- Monotone Circuits for Connectivity Require Super-Logarithmic Depth
- The Shrinkage Exponent of de Morgan Formulas is 2
- Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes
- Computation complexity of a ternary linear function
- A simplified proof of a lower complexity estimate
This page was built for publication:
