Theoretical Computer Science
Anand Kulkarni
  • Member for 11 years, 3 months
  • Last seen more than 10 years ago
Profile Activity
Stats
843
reputation
12k
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
All Questions Answers Articles
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
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?

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.