Aryabhata
  • Member for 11 years, 5 months
  • Last seen more than 2 years ago
72 answers
480 votes
176k views
975 bookmarks
What papers should everyone read?
39 answers
151 votes
45k views
349 bookmarks
What videos should everybody watch?
29 answers
137 votes
23k views
109 bookmarks
Problems Between P and NPC
11 answers
128 votes
11k views
62 bookmarks
How hard is unshuffling a string?
5 answers
65 votes
2k views
28 bookmarks
Problems that can be used to show polynomial-time hardness results
20 answers
50 votes
8k views
21 bookmarks
NP-hard problems on trees
8 answers
46 votes
7k views
28 bookmarks
The importance of Integrality Gap
5 answers
41 votes
5k views
22 bookmarks
What would you advise someone who wants to do research as a hobby?
2 answers
38 votes
2k views
14 bookmarks
Multiplying n polynomials of degree 1
1 answers
37 votes
1k views
12 bookmarks
Efficiently computable function as a counter-example to Sarnak's Mobius conjecture
3 answers
34 votes
2k views
11 bookmarks
Comparison-based data structure for finding items
5 answers
31 votes
1k views
13 bookmarks
what is easy for minor-excluded graphs?
1 answers
23 votes
873 views
9 bookmarks
Logspace algorithms on graphs with bounded tree width
2 answers
21 votes
1k views
6 bookmarks
Element distinctness in O(n) time?
1 answers
20 votes
485 views
7 bookmarks
Are there efficient general Bonferroni-style bounds known?
4 answers
14 votes
723 views
3 bookmarks
P-complete problems on trees