user avatar
user avatar
user avatar
András Salamon
  • Member for 11 years, 9 months
  • Last seen more than a month ago
72 answers
480 votes
177k views
977 bookmarks
What papers should everyone read?
92 answers
376 votes
112k views
533 bookmarks
Algorithms from the Book.
60 answers
228 votes
94k views
229 bookmarks
Major unsolved problems in theoretical computer science?
39 answers
151 votes
45k views
350 bookmarks
What videos should everybody watch?
30 answers
140 votes
24k views
113 bookmarks
Problems Between P and NPC
18 answers
120 votes
9k views
63 bookmarks
Examples of the price of abstraction?
7 answers
110 votes
9k views
78 bookmarks
Solid applications of category theory in TCS?
5 answers
102 votes
22k views
96 bookmarks
List of TCS conferences and workshops
14 answers
91 votes
19k views
96 bookmarks
What kind of mathematical background is needed for complexity theory?
2 answers
89 votes
34k views
48 bookmarks
What is the actual time complexity of Gaussian elimination?
5 answers
80 votes
4k views
48 bookmarks
Techniques for Reversing the Order of Quantifiers
7 answers
69 votes
4k views
33 bookmarks
Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)
7 answers
68 votes
4k views
31 bookmarks
Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?
17 answers
67 votes
4k views
34 bookmarks
Applications of TCS to classical mathematics?
3 answers
66 votes
8k views
48 bookmarks
How do I referee a paper?
5 answers
66 votes
6k views
32 bookmarks
The origin of the notion of treewidth
5 answers
65 votes
2k views
30 bookmarks
Problems that can be used to show polynomial-time hardness results
13 answers
60 votes
8k views
60 bookmarks
Open problems on the frontiers of TCS
18 answers
57 votes
2k views
26 bookmarks
Where and how did computers help prove a theorem?
3 answers
56 votes
2k views
23 bookmarks
Surprising algorithms for counting problems
3 answers
56 votes
8k views
40 bookmarks
Realizability theory: difference in power between Lambda calculus and Turing Machines
1 answer
53 votes
2k views
17 bookmarks
Is there a gap amplification type of result for the Graph Isomorphism Problem?
20 answers
51 votes
8k views
22 bookmarks
NP-hard problems on trees
4 answers
51 votes
5k views
12 bookmarks
What are the best current lower bounds on 3SAT?
4 answers
49 votes
12k views
21 bookmarks
Is finding the minimum regular expression an NP-complete problem?
9 answers
49 votes
10k views
22 bookmarks
Best Upper Bounds on SAT
11 answers
48 votes
3k views
17 bookmarks
What is the most efficient way to generate a random permutation from probabilistic pairwise swaps?
17 answers
46 votes
4k views
31 bookmarks
Physics results in TCS?
5 answers
46 votes
3k views
15 bookmarks
Positive topological ordering
10 answers
44 votes
4k views
30 bookmarks
Kolmogorov complexity applications in computational complexity
1
2 3 4 5
10