Representations of normalized formulas
From MaRDI portal
Recommendations
Cites work
- A simplified proof of a lower complexity estimate
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Complexity of the realization of a linear Boolean function in the class of -schemes
- Complexity of the realization of a linear function in the class of -circuits
- Computation complexity of a ternary linear function
- Formula complexity of a linear function in a \(k\)-ary basis
- scientific article; zbMATH DE number 3162894 (Why is no real title available?)
- scientific article; zbMATH DE number 855574 (Why is no real title available?)
- scientific article; zbMATH DE number 3089101 (Why is no real title available?)
- Lower bounds on the formula complexity of a linear Boolean function
- Method of determining lower bounds for the complexity of \(\Pi\)-circuits
- Monotone Circuits for Connectivity Require Super-Logarithmic Depth
- Sufficient conditions for the local repetition-freeness of minimal -schemes realizing linear Boolean functions
- The Shrinkage Exponent of de Morgan Formulas is 2
This page was built for publication: Representations of normalized formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5878634)