vix.ing · top · new · best · stats · spec

Lianna Hambardzumyan

  1. A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
    2021/11/19 by Lianna Hambardzumyan, Hamed Hatami, Hambardzumyan, Lianna +3 · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Cooperative Communication and Network Coding #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.CC #cs.DM #math.CO