Inoculation strategies for bounded degree graphs
Published in: Theoretical Computer Science, Volume 1035
We devise asymptotically tight bounds for the price of anarchy for several graph families in a model of epidemic containment.
Published in: Theoretical Computer Science, Volume 1035
We devise asymptotically tight bounds for the price of anarchy for several graph families in a model of epidemic containment.
Published in: The 16th Innovations in Theoretical Computer Science (ITCS)
We initiate the systematic study of the representational power of nearest and k-nearest neighbors through Boolean circuit complexity.
Published in: The 4th Workshop on Mathematical Reasoning and AI at NeurIPS
We introduce the Karp dataset: The first dataset composed of detailed proofs of NP-completeness reductions.
Published in: The 2023 IEEE International Symposium on Information Theory (ISIT)
We devise asymptotically tight bounds for the communication complexity of subsequence detections and the sample complexity (VC dimension) of a corresponding classifier.