Author:
Hambardzumyan Lianna,Hatami Hamed,Hatami Pooya
Publisher
Springer Science and Business Media LLC
Reference66 articles.
1. N. Alon, Covering graphs by the minimum number of equivalence relations, Combinatorica 6 (1986), 201–206.
2. L. Babai, P. Frankl and J. Simon, Complexity classes in communication complexity theory (preliminary version), in 27th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Washinton, DC, 1986, pp. 337–347.
3. W. D. Banks and A. Harcharras, On the norm of an idempotent Schur multiplier on the Schatten class, Proceedings of the American Mathematical Society 132 (2004), 2121–2125.
4. A. Blokhuis and T. Kloks, On the equivalence covering number of splitgraphs, Information Processing Letters 54 (1995), 301–304.
5. B. Bollobás and V. Nikiforov, Cliques and the spectral radius, Journal of Combinatorial Theory. Series B 97 (2007), 859–865.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. No Complete Problem for Constant-Cost Randomized Communication;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. On Blocky Ranks Of Matrices;computational complexity;2024-03-06