Some remarks on Boolean sums
From MaRDI portal
Publication:1133518
DOI10.1007/BF00268321zbMath0421.94022MaRDI QIDQ1133518
Publication date: 1979
Published in: Acta Informatica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R99: Discrete mathematics in relation to computer science
Related Items
Separating OR, SUM, and XOR circuits, Lower bounds for tropical circuits and dynamic programs, On a small class of Boolean sums, An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution, A method for obtaining efficient lower bounds for monotone complexity, Boolean functions whose monotone complexity is of size \(n^ 2\) / log n, \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice, Cancellation-free circuits in unbounded and bounded depth, On algorithm complexity, A very simple function that requires exponential size read-once branching programs., On Negations in Boolean Networks
Cites Work