Lower Bounds on Synchronous Combinational Complexity
From MaRDI portal
Publication:4199522
DOI10.1137/0208009zbMath0412.68037OpenAlexW2074419571MaRDI QIDQ4199522
Lawrence H. Harper, John E. Savage
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0208009
determinantlogic circuitsBoolean functionmarriage problemcombinational complexitysynchronous circuits
Related Items
Lower bounds for synchronous circuits and planar circuits ⋮ Constructive universal algebra: An introduction ⋮ Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC ⋮ The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms