2022 Developer Survey is open! Take survey.
user avatar
user avatar
user avatar
MGwynne
  • Member for 11 years
  • Last seen more than a month ago
  • London, United Kingdom
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?
5 answers
102 votes
22k views
96 bookmarks
List of TCS conferences and workshops
4 answers
72 votes
35k views
34 bookmarks
Why is 2SAT in P?
14 answers
67 votes
17k views
63 bookmarks
Applications of topology to computer science
13 answers
60 votes
8k views
60 bookmarks
Open problems on the frontiers of TCS
6 answers
49 votes
3k views
35 bookmarks
Good examples for how to write well in TCS
4 answers
42 votes
38k views
31 bookmarks
Why would one ever use an Octree over a KD-tree?
6 answers
38 votes
3k views
14 bookmarks
Grid $k$-coloring without monochromatic rectangles
7 answers
29 votes
22k views
18 bookmarks
Why is CNF used for SAT and not DNF?
6 answers
29 votes
1k views
10 bookmarks
Well known classes of boolean formulas that require exponentially long resolution proofs
5 answers
27 votes
60k views
36 bookmarks
To what extent is "advanced mathematics" needed/useful in A.I. research?
4 answers
23 votes
2k views
15 bookmarks
Starting SAT solver papers
1 answer
15 votes
2k views
4 bookmarks
How can a problem be in NP, be NP-hard and not NP-complete?
2 answers
14 votes
854 views
5 bookmarks
PARITY $\notin$ $AC^0$ with bounded fanout: easy proof?
1 answer
14 votes
756 views
3 bookmarks
Is Quasi-polynomial time in PSPACE?
0 answers
14 votes
479 views
3 bookmarks
DPLL and Lovász Local Lemma
1 answer
12 votes
1k views
4 bookmarks
Unique SAT vs Exactly $m$ models
3 answers
11 votes
909 views
1 bookmarks
Why are NPI problems not all of the same complexity?
2 answers
10 votes
771 views
1 bookmarks
Shortest formula for an n-term monotone CNF
4 answers
10 votes
729 views
7 bookmarks
What are the root difficulties in going from graphs to hypergraphs?
0 answers
9 votes
472 views
2 bookmarks
When is CSP faster than SMT/SAT?
3 answers
7 votes
507 views
3 bookmarks
How do you go from insights to formal solutions?
2 answers
5 votes
1k views
1 bookmarks
Number of edges in $K_4$-free graphs
1 answer
4 votes
459 views
1 bookmarks
Total number of spanning trees of a set of graphs
1 answer
-1 votes
283 views
1 bookmarks
Data representation and bit/time complexity
1 answer
-3 votes
554 views
1 bookmarks
Help proving a 3CNF related prob. is in P