Complexity of Monotone Networks for Computing Conjunctions

DOI10.1016/S0167-5060(08)70326-1MaRDI QIDQ4163136zbMATH OpenOpenAlexFDO

Authors Robert E. Tarjan

Publication date 1978

Published in Algorithmic Aspects of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70326-1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Cited in

(7)

• Improved algorithms for the multicut and multiflow problems in rooted trees
• Approximability of minimum AND-circuits
• An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution
• Boolean functions whose monotone complexity is of size \(n^ 2\) / log n
• A faster computation of the most vital edge of a shortest path
• \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice
• Lower bounds for additive complexity of linear operators and bilinear algorithms for matrix and polynomial multiplication over GF(2)

This page was built for publication: Complexity of Monotone Networks for Computing Conjunctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4163136)