2022 Developer Survey is open! Take survey.
user avatar
user avatar
user avatar
Anand Kulkarni
  • Member for 11 years, 9 months
  • Last seen more than 11 years ago
9 answers
93 votes
18k views
50 bookmarks
What would it mean to disprove Church-Turing thesis?
5 answers
65 votes
2k views
30 bookmarks
Problems that can be used to show polynomial-time hardness results
8 answers
40 votes
18k views
39 bookmarks
Why go to theoretical computer science/research?
5 answers
39 votes
1k views
16 bookmarks
Is there a logic without induction that captures much of P?
3 answers
23 votes
1k views
1 bookmarks
What is known about solutions to sparse integer linear programming problems?
2 answers
20 votes
1k views
6 bookmarks
Succinct circuit representation of graphs
3 answers
20 votes
535 views
8 bookmarks
Are recursive forms of Godel's statement possible?
1 answer
19 votes
453 views
5 bookmarks
Visualizing Unique Games
1 answer
12 votes
664 views
3 bookmarks
Using Kolmogorov complexity to establish proof complexity lower bounds?
5 answers
9 votes
447 views
7 bookmarks
Results showing existence/non-existence of finite graphs with specific computable properties imply certain complexity results
1 answer
8 votes
1k views
2 bookmarks
What are some effective heuristics to find the number of Hamiltonian paths in a rectangular grid?
2 answers
5 votes
363 views
1 bookmarks
Use of Lagrangian dual information to prove optimalitiy of a solution : Any example?
3 answers
5 votes
449 views
1 bookmarks
Is there a way to solve an optimization problem where a decision variable shows up in an upper bound (or lower bound) of summation?