Skip to main content
Theoretical Computer Science
Anand Kulkarni's user avatar
Anand Kulkarni's user avatar
Anand Kulkarni's user avatar
Anand Kulkarni
  • Member for 14 years, 1 month
  • Last seen more than 13 years ago
Profile Activity
Stats
853
reputation
13k
reached
7
answers
2
questions
Communities
About
PhD student at UC Berkeley IEOR working on theory, polytopes, and robotics.
Badges
View all badges
This user doesn’t have any gold badges yet.
6
silver badges
15
bronze badges
Top tags
View all tags
12
Score
3
Posts
33
Posts %
12
Score
1
Posts
11
Posts %
12
Score
1
Posts
11
Posts %
12
Score
1
Posts
11
Posts %
9
Score
2
Posts
22
Posts %
9
Score
2
Posts
22
Posts %
Top posts
answer
24
For which algorithms is there a large gap between the theoretical analysis and reality?
Sep 16, 2010
question
21
Are recursive forms of Godel's statement possible?
Aug 17, 2010
answer
12
Universal Turing Machines in "Computational Complexity" by Papadimitriou
Sep 12, 2010
answer
9
What is known about solutions to sparse integer linear programming problems?
Aug 18, 2010
answer
9
2D Cutting Stock Problem for Glass - Details mentioned
Sep 15, 2010
question
8
What’s the best way to test if a sphere is a polytope? (the Simplicial Steinitz Problem)
Jan 19, 2011
answer
7
What is the following variation on Set Cover known as?
Aug 16, 2010
answer
5
Results showing existence/non-existence of finite graphs with specific computable properties imply certain complexity results
Sep 16, 2010
answer
4
How can I model this usage scenario mathematically?
Sep 13, 2010
Top Meta posts
1
2
16
How can we collaboratively investigate open problems?
7
What sort of community feel are we aiming for?
Top network posts
View all network posts
6
How many vertices of a polytope can be chopped off to produce a k-vertex facet?
5
How are graph automorphisms are affected by transformations?