Theoretical Computer Science
Profile Activity
Meta user
Network profile
843
reputation
6
15

Anand Kulkarni

PhD student at UC Berkeley IEOR working on theory, polytopes, and robotics.
7
answers
2
questions
~11k
people reached

Communities (3)

Top Meta Posts
1
2

Top network posts

Top tags (0)

This user has not participated in any 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

Badges (21)

Gold

—

Silver

6

Rarest

Bronze

15

Rarest

View all badges →