User Pål GD

256 votes

11 answers

98k views

What is the enlightenment I'm supposed to attain after studying finite automata?

PhD

5,165

asked Dec 23, 2012 at 4:02

152 votes

39 answers

45k views

What videos should everybody watch?

soft-question big-list

Aaron Sterling

6,954

asked Sep 12, 2010 at 17:04

141 votes

30 answers

24k views

Problems Between P and NPC

cc.complexity-theory np-hardness big-list np-intermediate

Lev Reyzin♦

11.8k

asked Aug 17, 2010 at 2:07

62 votes

5 answers

4k views

Overarching reasons why problems are in P or BPP

big-list big-picture

Scott Aaronson

13.4k

asked Oct 3, 2013 at 2:02

61 votes

33 answers

4k views

Small steps for better TCS conferences?

soft-question big-list research-practice conferences

Jukka Suomela

11.3k

asked May 7, 2011 at 23:12

55 votes

18 answers

14k views

Most memorable CS paper titles

soft-question big-list

R B

9,378

asked Oct 22, 2014 at 11:03

52 votes

4 answers

4k views

Why do we consider log-space as a model of efficient computation (instead of polylog-space) ?

cc.complexity-theory space-bounded big-picture

Hsien-Chih Chang 張顯之

7,588

asked Dec 1, 2010 at 18:20

52 votes

11 answers

4k views

If you could rename dynamic programming...

ds.algorithms soft-question terminology ho.history-overview

Jack

447

asked Mar 24, 2011 at 22:43

46 votes

4 answers

4k views

Generalized Ladner's Theorem

cc.complexity-theory reference-request np-intermediate

András Salamon

18.7k

asked Aug 31, 2010 at 14:52

41 votes

7 answers

5k views

When does randomization speed up algorithms and it "shouldn't"?

randomized-algorithms

Dana Moshkovitz

10.9k

asked Apr 19, 2015 at 20:02

35 votes

8 answers

11k views

Alan Turing's Contributions to Computer Science

soft-question ho.history-overview

Lev Reyzin♦

11.8k

asked Jun 24, 2012 at 2:47

31 votes

4 answers

4k views

Consequences of NP=PSPACE

cc.complexity-theory complexity-classes conditional-results

Denis

7,672

asked Feb 13, 2014 at 17:11

30 votes

2 answers

2k views

NP-intermediate problems with efficient quantum solutions

cc.complexity-theory quantum-computing np np-intermediate

Huck Bennett

4,493

asked Dec 20, 2010 at 9:28

28 votes

6 answers

1k views

Natural NP-complete problems with "large" witnesses

cc.complexity-theory np proof-complexity

Marzio De Biasi

22.3k

asked Oct 26, 2014 at 19:24

26 votes

3 answers

854 views

The complexity of determining if a fixed graph is a minor of another

reference-request graph-theory co.combinatorics graph-algorithms

Timothy Sun

769

asked Aug 23, 2011 at 6:28

25 votes

2 answers

1k views

Complexity zoo for unary languages

cc.complexity-theory reference-request big-list

J.-E. Pin

4,721

asked May 11, 2015 at 13:41

25 votes

5 answers

2k views

Subexponentially solvable hard graph problems

cc.complexity-theory reference-request

Mohammad Al-Turkistany

20.6k

asked Dec 7, 2010 at 11:31

25 votes

1 answer

898 views

Is it still open to determine the complexity of computing the treewidth of planar graphs?

reference-request graph-theory np-hardness open-problem treewidth

a3nm

7,465

asked Sep 11, 2015 at 13:53

22 votes

5 answers

3k views

Program for computing Tree decomposition of a graph

ds.algorithms graph-theory graph-algorithms software treewidth

user4654

asked Apr 13, 2011 at 3:33

21 votes

1 answer

1k views

What is the current known hardness of Graph Isomorphism?

cc.complexity-theory complexity-classes graph-isomorphism

Mitch

845

asked Aug 31, 2011 at 20:58

19 votes

3 answers

630 views

What separates easy global problems from hard global problems on graphs of bounded treewidth?

graph-theory graph-algorithms treewidth

Juho

3,160

asked Sep 24, 2014 at 11:27

19 votes

1 answer

433 views

Minor closed properties that are explicitly MSO expressible

graph-theory lo.logic graph-minor topological-graph-theory

Mateus de Oliveira Oliveira

3,022

asked Jan 12, 2016 at 11:12

18 votes

2 answers

599 views

Polynomial time solvable instances of Max-Sat

sat treewidth max2sat

Martin Vatshelle

1,319

asked Jan 31, 2014 at 9:59

17 votes

2 answers

1k views

Comparing Two Algorithms for 3SUM problem over Integers

cc.complexity-theory ds.algorithms

kodlu

1,996

asked Apr 5, 2014 at 1:08

17 votes

2 answers

1k views

Forbidden minors for bounded treewidth graphs

graph-theory co.combinatorics treewidth graph-minor

Shiva Kintali

10.5k

asked Nov 17, 2011 at 19:01

15 votes

5 answers

1k views

Hardness of FPT problems

cc.complexity-theory parameterized-complexity fixed-parameter-tractable

Nikhil

654

asked Feb 14, 2011 at 5:57

14 votes

1 answer

313 views

SERF-reducibility and subexponential algorithms

cc.complexity-theory reference-request

Janne H. Korhonen

1,474

asked Dec 1, 2011 at 20:11

14 votes

9 answers

1k views

Counterintuitive results for undergraduates

big-list teaching intuition

Anonymous

3,993

asked May 26, 2015 at 2:52

14 votes

1 answer

720 views

Second Smallest $s$-$t$-Cut in a Network

cc.complexity-theory optimization max-flow-min-cut flow-problems

Oliver Witt

439

asked Apr 15, 2015 at 8:53

13 votes

1 answer

353 views

Does treewidth $k$ imply the existence of a $K_{1,k}$ minor?

graph-theory treewidth graph-minor

Juho

3,160

asked Jun 9, 2015 at 13:57

Stack Exchange Network

current community

your communities

more stack exchange communities

39 Bookmarks

What is the enlightenment I'm supposed to attain after studying finite automata?

What videos should everybody watch?

Problems Between P and NPC

Overarching reasons why problems are in P or BPP

Small steps for better TCS conferences?

Most memorable CS paper titles

Why do we consider log-space as a model of efficient computation (instead of polylog-space) ?

If you could rename dynamic programming...

Generalized Ladner's Theorem

When does randomization speed up algorithms and it "shouldn't"?

Alan Turing's Contributions to Computer Science

Consequences of NP=PSPACE

NP-intermediate problems with efficient quantum solutions

Natural NP-complete problems with "large" witnesses

The complexity of determining if a fixed graph is a minor of another

Complexity zoo for unary languages

Subexponentially solvable hard graph problems

Is it still open to determine the complexity of computing the treewidth of planar graphs?

Program for computing Tree decomposition of a graph

What is the current known hardness of Graph Isomorphism?

What separates easy global problems from hard global problems on graphs of bounded treewidth?

Minor closed properties that are explicitly MSO expressible

Polynomial time solvable instances of Max-Sat

Comparing Two Algorithms for 3SUM problem over Integers

Forbidden minors for bounded treewidth graphs

Hardness of FPT problems

SERF-reducibility and subexponential algorithms

Counterintuitive results for undergraduates

Second Smallest $s$-$t$-Cut in a Network

Does treewidth $k$ imply the existence of a $K_{1,k}$ minor?