scientific article; zbMATH DE number 3387244
From MaRDI portal
Publication:5656695
Cited in
(13)- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
- On the complexity of slice functions
- More on the complexity of slice functions
- Some remarks on Boolean sums
- On another Boolean matrix
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
- A very simple function that requires exponential size read-once branching programs.
- Separating OR, SUM, and XOR circuits
- Boolean matrices ... neither Boolean nor matrices
- scientific article; zbMATH DE number 2108319 (Why is no real title available?)
- scientific article; zbMATH DE number 6412861 (Why is no real title available?)
- On a family of Boolean matrices
- Perspective on complexity measures targeting read-once branching programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656695)
