Lower bounds on threshold and related circuits via communication complexity
From MaRDI portal
Publication:4308780
DOI10.1109/18.312169zbMath0810.94043OpenAlexW2163904244MaRDI QIDQ4308780
Alon Orlitsky, Kai-Yeung Siu, Vwani P. Roychowdhury
Publication date: 28 November 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/ecetr/306
Related Items
On the computation of Boolean functions by analog circuits of bounded fan-in, Unnamed Item, Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity
