Muli Safra
- Interactive proofs and the hardness of approximating cliques
1996/03/01 by Uriel Feige, Shafi Goldwasser, László Lovász +5 · 30 citations
Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Advanced Graph Theory Research
- Probabilistic checking of proofs; a new characterization of NP
1992/01/01 by Sanjeev Arora, Muli Safra · 5 citations
Computer Science · #Cryptography and Data Security #Complexity and Algorithms in Graphs #Formal Methods in Verification
- Probabilistic checking of proofs
1998/01/01 by Sanjeev Arora, Muli Safra · 3 citations
Computer Science · Mathematics · #Cryptography and Data Security #Complexity and Algorithms in Graphs #Formal Methods in Verification #Mathematical proof #Characterization (materials science) #Clique #Class (philosophy) #Logarithm #Discrete mathematics #Probabilistic logic #Mathematics #Combinatorics #Set (abstract data type) #Time complexity #Complexity class #Computer science #Statistics
- Approximating clique is almost NP-complete
2002/12/09 by Uriel Feige, S. Goldwasser, László Lovász +2 · 2 citations
Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Machine Learning and Algorithms #Clique #Combinatorics #Computational complexity theory #Treewidth #Clique problem #Omega #Discrete mathematics #Mathematics #Approximation algorithm #EXPTIME #Graph #Computer science #Algorithm #Chordal graph #Philosophy #Pathwidth #PSPACE
- Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition
2006/01/01 by Shmuel Safra, Muli Safra · 1 citation
Computer Science · #semigroups and automata theory #Formal Methods in Verification #Machine Learning and Algorithms