scientific article; zbMATH DE number 3387244
From MaRDI portal
Publication:5656695
zbMATH Open0244.94022MaRDI QIDQ5656695FDOQ5656695
Authors: È. I. Nechiporuk 
Publication date: 1971
Title of this publication is not available (Why is that?)
Cited In (13)
- Separating OR, SUM, and XOR circuits
- A very simple function that requires exponential size read-once branching programs.
- Some remarks on Boolean sums
- On another Boolean matrix
- On a family of Boolean matrices
- Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
- Title not available (Why is that?)
- Perspective on complexity measures targeting read-once branching programs
- Boolean matrices ... neither Boolean nor matrices
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
- Title not available (Why is that?)
- More on the complexity of slice functions
- On the complexity of slice functions
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)
