Tradeoffs in depth-two superconcentrators

[免费ChatGPT] [DeepSeek可用网址] [PDF] neu.edu

Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates

A Gál, KA Hansen, M Koucký, P Pudlák… - Proceedings of the forty …, 2012 - dl.acm.org
We bound the minimum number w of wires needed to compute any (asymptotically good)
error-correcting code C:{0, 1} Ω (n)->{0, 1} n with minimum distance Ω (n), using unbounded …
Shrani Navedi Navedeno v 32 virih Sorodni članki Vse različice: 23
[免费ChatGPT] [DeepSeek可用网址] [PDF] ias.ac.in

More on a problem of Zarankiewicz

C Dutta, J Radhakrishnan - International Symposium on Algorithms and …, 2012 - Springer
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs
whose union is a larger bipartite graph that has no large bipartite independent set. Our main …
Shrani Navedi Navedeno v 2 virih Sorodni članki Vse različice: 5
[免费ChatGPT] [DeepSeek可用网址] [PDF] arxiv.org

On Zarankiewicz Problem and Depth-Two Superconcentrators

C Dutta, J Radhakrishnan - arxiv preprint arxiv:1201.1377, 2012 - arxiv.org
We show tight necessary and sufficient conditions on the sizes of small bipartite graphs
whose union is a larger bipartite graph that has no large bipartite independent set. Our main …
Shrani Navedi Navedeno v 1 virih Sorodni članki Vse različice: 3 V obliki HTML