My posts are related to various topics and open problems in Computational Complexity, Circuit Complexity, Communication Complexity, Algorithmic Game Theory, Polyhedral Combinatorics, Hardness of Approximation, Approximation Algorithms and Graph Theory.
Editor reviews are provided by professional editors who evaluate a blog based on the following criteria: Frequency of Updates, Relevance of Content, Site Design, and Writing Style.
One of the primary goals of complexity theory is separating complexity classes, a.k.a proving lower bounds. Embarrassingly we have only a handful of unconditional separation results. Separating P from NP is of course the mother of all such goals....
Today’s post is about “Why tabletPC ?” and more importantly “What features should an ideal tabletPC have ?“ I have been thinking of writing this post for more than an year. Somehow I think I have to write this asap, because there are too many silly...
Today’s post is about TreeWidth, an awesome concept introduced by Robertson and Seymour, 25 years ago. When I first came across treewidth, I became an instant fan.
Definition : A tree-decomposition of a graph is a pair where is a family of subsets...
Here are some open problems (that interest me) from FOCS 2009. If you want to share an open problem, please leave a comment.
Starting with my paper…….
1) Reducibility Among Fractional Stability Problems
Shiva Kintali, Laura Poplawski, Rajmohan...
