Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. N. Alon: The Shannon capacity of a union, Combinatorica18 (1998), 301–310.
2. B. Bukh and C. Cox: On a fractional version of Haemers’ bound, arXiv:1802.00476, 2018.
3. P. Bürgisser, M. Clausen and M. Amin Shokrollahi: Algebraic complexity theory, volume 315 of Grundlehren Math. Wiss. Springer-Verlag, Berlin, 1997.
4. A. Blasiak: A graph-theoretic approach to network coding, PhD thesis, Cornell University, 2013.
5. E. Becker and N. Schwartz: Zum Darstellungssatz von Kadison-Dubois, Arch. Math. (Basel)40 (1983), 421–428.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献