vix.ing · top · new · best · stats

Mario Szegedy

  1. Interactive proofs and the hardness of approximating cliques
    1996/03/01 by Uriel Feige, Shafi Goldwasser, László Lovász +5 · 527 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Clique #Combinatorial proof #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Connection (principal bundle) #Correctness #Cryptography and Data Security #Discrete mathematics #Gas meter prover #Graph #Mathematical proof #Mathematics
  2. Efficient Testing of Large Graphs
    2000/04/01 by Noga Alon, Eldar Fischer, Michael Krivelevich +2 · 212 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Alternation (linguistics) #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Graph coloring #Limits and Structures in Graph Theory #Mathematics #Property (philosophy) #Property testing
  3. Debate is efficient with your time
    2026/02/09 by Jonah Brown-Cohen, Geoffrey Irving, Simon C. Marshall +3 · 1 voice
    Computer Science · #cs.AI #cs.CC