User MGwynne

372

votes

92

answers

111k

views

Algorithms from the Book.

Jan 5 '19 at 10:30 Community♦ 1

226

votes

60

answers

92k

views

Major unsolved problems in theoretical computer science?

big-list open-problem

Feb 10 '20 at 13:30 Community♦ 1

147

votes

39

answers

43k

views

What videos should everybody watch?

soft-question big-list

Apr 5 '20 at 1:36 Raphael Augusto 533

96

votes

5

answers

21k

views

List of TCS conferences and workshops

soft-question big-list conferences

Aug 18 at 2:25 Mahdi Cheraghchi 3,856

65

votes

14

answers

15k

views

Applications of topology to computer science

reference-request ho.history-overview topology survey

Nov 15 '15 at 9:31 Richard Cox 119

65

votes

4

answers

30k

views

Why is 2SAT in P?

cc.complexity-theory np-hardness big-picture polynomial-time

Jun 9 '11 at 8:06 Dave 591

60

votes

13

answers

8k

views

Open problems on the frontiers of TCS

big-list open-problem

Jun 4 '20 at 2:45 Community♦ 1

49

votes

6

answers

3k

views

Good examples for how to write well in TCS

soft-question writing

Oct 16 '12 at 6:24 Community♦ 1

39

votes

4

answers

35k

views

Why would one ever use an Octree over a KD-tree?

ds.data-structures tree

Jun 13 '12 at 10:38 J D 365

37

votes

6

answers

3k

views

Grid $k$-coloring without monochromatic rectangles

co.combinatorics puzzles open-problem ramsey-theory graph-colouring

Aug 8 '12 at 17:18 Daniel Apon 5,925

28

votes

6

answers

1k

views

Well known classes of boolean formulas that require exponentially long resolution proofs

reference-request big-list sat proof-complexity lo.logic

Jan 20 '12 at 12:42 Jan Johannsen 4,473

27

votes

7

answers

19k

views

Why is CNF used for SAT and not DNF?

ds.algorithms sat

Jun 18 '15 at 14:01 Lenar Hoyt 304

25

votes

5

answers

57k

views

To what extent is “advanced mathematics” needed/useful in A.I. research?

soft-question machine-learning ai.artificial-intel

Jul 21 '17 at 15:04 John Ray 1

24

votes

4

answers

2k

views

Starting SAT solver papers

ds.algorithms reference-request lo.logic sat

Nov 13 '13 at 9:54 Vijay D 12.1k

15

votes

1

answer

1k

views

How can a problem be in NP, be NP-hard and not NP-complete?

cc.complexity-theory np-hardness complexity-classes terminology

Apr 13 '13 at 19:03 Community♦ 1

14

votes

1

answer

735

views

Is Quasi-polynomial time in PSPACE?

cc.complexity-theory complexity-classes time-complexity space-complexity

Feb 28 '14 at 20:41 Tayfun Pay 2,549

14

votes

0

answers

462

views

DPLL and Lovász Local Lemma

cc.complexity-theory ds.algorithms sat

Aug 13 '11 at 20:42 Kaveh 21k

12

votes

1

answer

1k

views

Unique SAT vs Exactly $m$ models

cc.complexity-theory reference-request np-hardness sat reductions

Nov 24 '11 at 10:20 Xavier Labouze 1,037

12

votes

2

answers

827

views

PARITY $\notin$ $AC^0$ with bounded fanout: easy proof?

cc.complexity-theory circuit-complexity

Jun 23 '16 at 12:24 Community♦ 1

11

votes

3

answers

846

views

Why are NPI problems not all of the same complexity?

cc.complexity-theory complexity-classes np-intermediate

Mar 9 '12 at 18:46 Community♦ 1

10

votes

2

answers

721

views

Shortest formula for an n-term monotone CNF

cc.complexity-theory circuit-complexity formulas

Jun 23 '11 at 13:28 Noam 9,239

10

votes

4

answers

698

views

What are the root difficulties in going from graphs to hypergraphs?

graph-theory co.combinatorics hypergraphs

Mar 22 '11 at 3:14 Hsien-Chih Chang 張顯之 7,477

9

votes

0

answers

456

views

When is CSP faster than SMT/SAT?

sat csp

Jul 8 '11 at 13:23 jah 91

7

votes

3

answers

495

views

How do you go from insights to formal solutions?

soft-question advice-request

Aug 21 '11 at 18:39 Tsuyoshi Ito 16.1k

5

votes

2

answers

708

views

Number of edges in $K_4$-free graphs

graph-theory co.combinatorics upper-bounds

Jun 10 '11 at 2:33 Perce 121

4

votes

1

answer

395

views

Total number of spanning trees of a set of graphs

graph-theory graph-algorithms

Nov 30 '14 at 23:39 Peter Shor 23.1k

-1

votes

1

answer

260

views

Data representation and bit/time complexity

cc.complexity-theory terminology

Jul 22 '11 at 5:53 danielzinn 288

-3

votes

1

answer

504

views

Help proving a 3CNF related prob. is in P

cc.complexity-theory complexity-classes computability sat polynomial-time

Jul 15 '12 at 4:32 Luke Mathieson 1,148

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

28 Bookmarks

Algorithms from the Book.

Major unsolved problems in theoretical computer science?

What videos should everybody watch?

List of TCS conferences and workshops

Applications of topology to computer science

Why is 2SAT in P?

Open problems on the frontiers of TCS

Good examples for how to write well in TCS

Why would one ever use an Octree over a KD-tree?

Grid $k$-coloring without monochromatic rectangles

Well known classes of boolean formulas that require exponentially long resolution proofs

Why is CNF used for SAT and not DNF?

To what extent is “advanced mathematics” needed/useful in A.I. research?

Starting SAT solver papers

How can a problem be in NP, be NP-hard and not NP-complete?

Is Quasi-polynomial time in PSPACE?

DPLL and Lovász Local Lemma

Unique SAT vs Exactly $m$ models

PARITY $\notin$ $AC^0$ with bounded fanout: easy proof?

Why are NPI problems not all of the same complexity?

Shortest formula for an n-term monotone CNF

What are the root difficulties in going from graphs to hypergraphs?

When is CSP faster than SMT/SAT?

How do you go from insights to formal solutions?

Number of edges in $K_4$-free graphs

Total number of spanning trees of a set of graphs

Data representation and bit/time complexity

Help proving a 3CNF related prob. is in P