Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
Babai, L. and Gál, A. and Kollár, J. and Rónyai, Lajos and Szabó, T. and Wigderson, A. (1996) Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. In: STOC '96. Proceedings of the twenty-eighth annual ACM symposium on the theory of computing. Philadelphia, 1996..
Full text not available from this repository.Item Type: | Conference or Workshop Item (Paper) |
---|---|
Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
Divisions: | Informatics Laboratory |
Depositing User: | Eszter Nagy |
Date Deposited: | 11 Dec 2012 14:51 |
Last Modified: | 11 Dec 2012 14:51 |
URI: | https://eprints.sztaki.hu/id/eprint/1127 |
Update Item |