Author:
Kaibel Volker,Weltge Stefan
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference10 articles.
1. Lecture Notes in Computer Science;D Avis,2013
2. Braun, G., Pokutta, S.: Common information and unique disjointness. In: Foundations of Computer Science (FOCS), IEEE 54th Annual Symposium, pp. 688–697 (2013)
3. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In: STOC, pp. 95–106 (2012)
4. Jukna, S.: Boolean Function Complexity: Advances and Frontiers. Springer, Berlin (2012)
5. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (2006)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献