Cyriac Antony
  • Member for 4 years, 1 month
  • Last seen this week
  • India
72 answers
480 votes
175k views
974 bookmarks
What papers should everyone read?
39 answers
265 votes
132k views
633 bookmarks
What Books Should Everyone Read?
42 answers
82 votes
17k views
75 bookmarks
Funny TCS-related papers etc?
13 answers
122 votes
12k views
133 bookmarks
Advice on good research practices
9 answers
82 votes
10k views
52 bookmarks
Are research papers hard to read?
3 answers
39 votes
9k views
10 bookmarks
Is optimally solving the n×n×n Rubik's Cube NP-hard?
20 answers
50 votes
8k views
21 bookmarks
NP-hard problems on trees
5 answers
65 votes
6k views
32 bookmarks
The origin of the notion of treewidth
16 answers
30 votes
5k views
17 bookmarks
Hard-looking algorithmic problems made easy by theorems
2 answers
25 votes
5k views
6 bookmarks
Natural CLIQUE to k-Color reduction
2 answers
35 votes
5k views
20 bookmarks
Status of Impagliazzo's Worlds?
7 answers
68 votes
4k views
31 bookmarks
Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?
4 answers
13 votes
4k views
7 bookmarks
Consequences of $NP=coNP$ and $P\ne NP$?
13 answers
31 votes
4k views
19 bookmarks
Are there any counterintuitive results in theoretical computer science?
2 answers
34 votes
4k views
9 bookmarks
Reference for NP-hardness of 3-colouring?
5 answers
21 votes
3k views
8 bookmarks
Reasons for which a graph may be not $k$ colorable?
12 answers
63 votes
3k views
24 bookmarks
Parameterized complexity from P to NP-hard and back again
3 answers
37 votes
2k views
12 bookmarks
Techniques for showing that problem is in hardness "limbo"
7 answers
30 votes
2k views
11 bookmarks
Proving lower bounds by proving upper bounds
5 answers
19 votes
2k views
9 bookmarks
(False?) proof for computability of a function?
6 answers
24 votes
2k views
13 bookmarks
Graph families which have polynomial time algorithms for computing the chromatic number
6 answers
34 votes
2k views
14 bookmarks
Why are so few natural candidates for NP-intermediate status?
5 answers
65 votes
2k views
28 bookmarks
Problems that can be used to show polynomial-time hardness results
17 answers
35 votes
2k views
19 bookmarks
Hardness jumps in computational complexity?
3 answers
25 votes
2k views
14 bookmarks
Hardness of approximation - additive error
1 answers
18 votes
2k views
7 bookmarks
What are the #P-complete subfamilies of #2-SAT?
2 answers
11 votes
2k views
6 bookmarks
On the provability of P versus NP
7 answers
28 votes
2k views
10 bookmarks
Nontrivial membership in NP
4 answers
13 votes
2k views
2 bookmarks
hardness of approximating the chromatic number in graphs with bounded degree
4 answers
26 votes
2k views
13 bookmarks
Best known deterministic time complexity lower bound for a natural problem in NP