Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Anand Kulkarni
ocf.berkeley.edu/~anandk
PhD student at UC Berkeley IEOR working on theory, polytopes, and robotics.
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
17
votes
Are recursive forms of Godel's statement possible?
cc.complexity-theory
lo.logic
asked Aug 17 '10 at 5:22
cstheory.stackexchange.com
8
votes
What’s the best way to test if a sphere is a polytope? (the Simplicial Steinitz Problem)
cg.comp-geom
asked Jan 19 '11 at 21:23
cstheory.stackexchange.com
Top Answers
12
For which algorithms is there a large gap between the theoretical analysis and reality?
cstheory.stackexchange.com
8
What is known about solutions to sparse integer linear programming problems?
cstheory.stackexchange.com
7
2D Cutting Stock Problem for Glass - Details mentioned
cstheory.stackexchange.com
5
What is the following variation on Set Cover known as?
cstheory.stackexchange.com
5
Results showing existence/non-existence of finite graphs with specific computable properties imply certain complexity results
cstheory.stackexchange.com
cstheory.stackexchange.com
