User Karolina Sołtys

134

votes

29

answers

21k

views

Problems Between P and NPC

Aug 15 at 23:45 Mark S 802

60

votes

13

answers

8k

views

Open problems on the frontiers of TCS

big-list open-problem

Jun 4 at 2:45 Community♦ 1

24

votes

19

answers

3k

views

What tools do you use to give presentations?

soft-question research-practice writing

May 10 at 19:38 Denis 6,695

146

votes

39

answers

42k

views

What videos should everybody watch?

soft-question big-list

Apr 5 '20 at 1:36 Raphael Augusto 533

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

68

votes

7

answers

4k

views

Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)

cc.complexity-theory lo.logic pl.programming-languages big-picture set-theory

Feb 20 '19 at 3:43 Timothy Chow 6,893

34

votes

17

answers

2k

views

Hardness jumps in computational complexity?

cc.complexity-theory

Jan 3 '19 at 18:34 Community♦ 1

25

votes

4

answers

945

views

What's the “smallest” complexity class for which a superlinear circuit bound is known?

cc.complexity-theory circuit-complexity

Oct 4 '17 at 2:22 Dmytro Taranovsky 2,092

42

votes

4

answers

2k

views

Why have we not been able to develop a unified complexity theory of distributed computing?

big-picture dc.distributed-comp

Jun 14 '17 at 17:11 lamba 131

54

votes

2

answers

3k

views

Can one amplify P=NP beyond P=PH?

cc.complexity-theory reference-request complexity-classes conditional-results polynomial-hierarchy

May 18 '17 at 12:42 András Salamon 18.4k

33

votes

3

answers

2k

views

Is $AC^0/poly \cap NP$ contained in $P$?

cc.complexity-theory circuit-complexity uniformity

Apr 3 '17 at 17:01 Community♦ 1

65

votes

11

answers

5k

views

What are good references to understanding the proof of the PCP theorem?

cc.complexity-theory reference-request pcp

Sep 21 '16 at 19:42 Sasho Nikolov 17.8k

25

votes

3

answers

990

views

Reverse Graph Spectra Problem?

ds.algorithms graph-theory graph-algorithms spectral-graph-theory

Feb 13 '16 at 5:13 Jeffrey Shallit 6,818

86

votes

14

answers

17k

views

What kind of mathematical background is needed for complexity theory?

cc.complexity-theory soft-question advice-request

Nov 15 '15 at 17:26 Community♦ 1

32

votes

4

answers

853

views

Hardness of approximation assuming NP != coNP

approximation-hardness conditional-results

Sep 9 '15 at 23:29 Abhinav 103

33

votes

3

answers

939

views

An Anthology of Complexity Assumptions

cc.complexity-theory complexity-classes big-list complexity-assumptions

Sep 1 '15 at 18:22 Community♦ 1

39

votes

2

answers

944

views

How many distinct colors are needed to lower-bound the choosability of a graph?

graph-theory co.combinatorics graph-colouring exp-time-algorithms

Aug 10 '15 at 22:58 RJK 1,932

20

votes

1

answer

569

views

FPT vs W[P] - Parameterized Complexity

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

Apr 8 '15 at 15:34 Huck Bennett 4,412

29

votes

1

answer

1k

views

Are there canonical non-relativizing techniques?

cc.complexity-theory oracles relativization

Mar 16 '15 at 9:15 Jan Johannsen 4,474

38

votes

2

answers

3k

views

Semantic vs. Syntactic Complexity Classes

cc.complexity-theory complexity-classes big-picture

Jan 10 '15 at 11:54 Community♦ 1

33

votes

3

answers

2k

views

complexity of greatest common divisor (gcd)

cc.complexity-theory reference-request complexity-classes nt.number-theory

Jan 5 '15 at 16:24 SamiD 2,257

20

votes

4

answers

867

views

Examples of hardness phase transitions

cc.complexity-theory counting-complexity approximation-hardness phase-transition

May 12 '14 at 22:55 Tayfun Pay 2,549

16

votes

2

answers

921

views

Collatz Conjecture & Grammars / Automata

fl.formal-languages nt.number-theory halting-problem

Nov 27 '13 at 2:16 Community♦ 1

36

votes

13

answers

2k

views

Easy decision problem, hard search problem

cc.complexity-theory big-list

Oct 29 '13 at 15:01 Community♦ 1

8

votes

2

answers

739

views

Quantum PCP and hardness of simulating of Hamiltonians

cc.complexity-theory quantum-computing approximation-hardness pcp physics

Oct 13 '13 at 0:46 Community♦ 1

26

votes

3

answers

2k

views

Is it NP-hard to play international draughts correctly?

cc.complexity-theory np-hardness open-problem board-games

Apr 30 '13 at 3:34 Community♦ 1

28

votes

2

answers

852

views

Tight Lower bounds on Savitch's theorem

cc.complexity-theory space-bounded

Dec 23 '12 at 10:24 Pratik Deoghare 1,914

44

votes

5

answers

1k

views

Casual tours around proofs

soft-question big-list

Nov 11 '11 at 8:00 Kris 143

32

votes

1

answer

2k

views

Is Gap-3SAT NP-complete even for 3CNF formulas where no pair of variables appears in significantly more clauses than the average?

cc.complexity-theory sat approximation-hardness

Sep 5 '11 at 19:17 Joe Fitzsimons 13.3k

27

votes

4

answers

1k

views

Compendium of the Best Approximation and Hardness Results for NP optimization problems

ds.algorithms reference-request approximation-algorithms approximation-hardness

Aug 25 '11 at 16:14 Randomizer 741

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

64 Bookmarks

Problems Between P and NPC

Open problems on the frontiers of TCS

What tools do you use to give presentations?

What videos should everybody watch?

Major unsolved problems in theoretical computer science?

Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)

Hardness jumps in computational complexity?

What's the “smallest” complexity class for which a superlinear circuit bound is known?

Why have we not been able to develop a unified complexity theory of distributed computing?

Can one amplify P=NP beyond P=PH?

Is $AC^0/poly \cap NP$ contained in $P$?

What are good references to understanding the proof of the PCP theorem?

Reverse Graph Spectra Problem?

What kind of mathematical background is needed for complexity theory?

Hardness of approximation assuming NP != coNP

An Anthology of Complexity Assumptions

How many distinct colors are needed to lower-bound the choosability of a graph?

FPT vs W[P] - Parameterized Complexity

Are there canonical non-relativizing techniques?

Semantic vs. Syntactic Complexity Classes

complexity of greatest common divisor (gcd)

Examples of hardness phase transitions

Collatz Conjecture & Grammars / Automata

Easy decision problem, hard search problem

Quantum PCP and hardness of simulating of Hamiltonians

Is it NP-hard to play international draughts correctly?

Tight Lower bounds on Savitch's theorem

Casual tours around proofs

Is Gap-3SAT NP-complete even for 3CNF formulas where no pair of variables appears in significantly more clauses than the average?

Compendium of the Best Approximation and Hardness Results for NP optimization problems