Anand Kulkarni

less info
meta site favicon meta user | stack exchange network profile network profile
538 reputation
212
bio website ocf.berkeley.edu/~anandk
location
age
visits member for 1 year, 9 months
seen May 12 '11 at 17:18
stats profile views 132
PhD student at UC Berkeley IEOR working on theory, polytopes, and robotics.

538 Reputation

+15 Are recursive forms of Godel's statement possible?
+20 Results showing existence/non-existence of finite graphs with specific computable properties imply certain complexity results
+20 What’s the best way to test if a sphere is a polytope? (the Simplicial Steinitz Problem)
+10 What is known about solutions to sparse integer linear programming problems?
view more

14 Tags

10
cc.complexity-theory × 3
5
np-hardness
8
co.combinatorics
5
set-cover
8
integer-programming
4
network-modeling
6
ds.data-structures × 2
4
dc.distributed-comp
6
ds.algorithms × 2
3
universal-computation
view more

14 Badges

recent class name
 Yearling  Nice Question
 Scholar  Commentator
 Nice Answer  Beta
 Quorum  Critic
 Precognitive  Editor
view more

119 Votes Cast

all time   by type  
115 up 62 question
4 down 57 answer
view more