Abstract: Schaffer and Yannakakis have shown that the max-cut problem with the FLIP neighborhood is polynomial-time local search (PLS) complete, and hence among the most difficult problems in the PLS class.

Abstract: I will provide an account of my research in various areas. As an exemplar, I will discuss the first two topics in greater detail.

Abstract:*The problem of approximate sampling using Markov Chain Monte Carlo has received considerable attention in the Theoretical Computer Science and Physics communities.

Abstract: Artificial Intelligence (AI)/ Machine Learning (ML)/ Neural Network (NN) algorithms are being widely used currently for various applications that include self driving cars, virtual assistants on smartphones and other dev

Abstract: The problem of list-decoding an error-correcting code is the following: