Theoretical Computer Science
Anand Kulkarni
Profile Activity
Stats
843
reputation
12k
reached
7
answers
2
questions
About
PhD student at UC Berkeley IEOR working on theory, polytopes, and robotics.

Communities (3)

Top Meta Posts
1
2

Top network posts

This user doesn’t have any gold badges yet.
6
silver badges
15
bronze badges
View all badges

Top tags (15)

Score 12
Posts 3
Posts % 33
Score 12
Posts 1
Score 12
Posts 1
Score 12
Posts 1
Score 9
Posts 2
Score 9
Posts 2
View all tags →

Top posts (9)

All Questions Answers
Votes Newest
23 For which algorithms is there a large gap between the theoretical analysis and reality? Sep 16 '10
20 Are recursive forms of Godel's statement possible? Aug 17 '10
12 Universal Turing Machines in "Computational Complexity" by Papadimitriou Sep 12 '10
9 What is known about solutions to sparse integer linear programming problems? Aug 18 '10
9 2D Cutting Stock Problem for Glass - Details mentioned Sep 15 '10
8 What’s the best way to test if a sphere is a polytope? (the Simplicial Steinitz Problem) Jan 19 '11
7 What is the following variation on Set Cover known as? Aug 16 '10
5 Results showing existence/non-existence of finite graphs with specific computable properties imply certain complexity results Sep 16 '10
4 How can I model this usage scenario mathematically? Sep 13 '10

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.