No. Title Author Year
1 Computing Exact Minimum Cuts Without Knowing the Graph Rubinstein, Aviad et al. 2018
2 Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds Abboud, Amir et al. 2018
3 Detecting communities is Hard (And Counting Them is Even Harder) Rubinstein, Aviad 2017
4 Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder Rubinstein, Aviad 2017
Current Page :
Number of result pages: 1
Number of documents: 4


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI