User Gil Kalai

38 votes

What would it mean to disprove Church-Turing thesis?

answered Sep 2, 2010 at 22:27

34 votes

Applications of TCS to classical mathematics?

answered Oct 28, 2010 at 5:39

24 votes

Coloring Planar Graphs

answered Jan 1, 2011 at 10:01

21 votes

Should we consider $\mathsf{P} \neq \mathsf{NP}$ a law of nature?

answered Jan 28, 2013 at 1:32

18 votes

Accepted

Complex analysis in theoretical computer science

answered Jan 13, 2013 at 17:47

17 votes

Quantum computing project ideas

answered Aug 30, 2010 at 12:09

15 votes

Major unsolved problems in theoretical computer science?

answered Sep 7, 2010 at 17:38

15 votes

Overarching reasons why problems are in P or BPP

answered Oct 3, 2013 at 20:04

14 votes

Examples of the price of abstraction?

answered Sep 1, 2010 at 15:29

13 votes

Intractability of NP-complete problems as a principle of physics?

answered Sep 24, 2010 at 13:30

13 votes

Suppose $\mathbf{P} = \mathbf{BQP}$. Then what is randomness? Would it even exist at all?

answered May 17, 2015 at 17:53

12 votes

Reasons for which a graph may be not $k$ colorable?

answered Dec 1, 2012 at 20:10

12 votes

Applications of representation theory of the symmetric group

answered Sep 25, 2012 at 0:30

12 votes

Conjectures implying Four Color Theorem

answered Dec 29, 2012 at 18:13

11 votes

Reasons for which a graph may be not $k$ colorable?

answered Dec 1, 2012 at 19:35

11 votes

Extension to the Stable Marriage Problem ?

answered Sep 30, 2010 at 13:53

10 votes

Applications of TCS to classical mathematics?

answered Nov 14, 2010 at 18:15

10 votes

The cozy neighborhoods of "P" and of "NP-hard"

answered Dec 26, 2012 at 5:49

9 votes

Are edge-vertex graphs of polytopes (decent) expanders?

answered Dec 29, 2012 at 18:22

9 votes

Maximal/maximum independent sets

answered Jan 1, 2013 at 9:10

8 votes

Examples in which the size of the alphabet ($\geq 2$) used for an encoding matters

answered Nov 16, 2010 at 2:55

7 votes

Are all the functions whose fourier weight is concentrated on the small sized sets computed by AC0 circuits?

answered Jan 2, 2013 at 10:18

6 votes

Rigour leading to insight

answered Nov 16, 2010 at 15:55

6 votes

Applications of TCS to classical mathematics?

answered Nov 23, 2010 at 20:35

6 votes

Using error-correcting codes in theory

answered Oct 10, 2010 at 17:38

6 votes

Information Theory used to prove neat combinatorial statements?

answered Dec 28, 2012 at 7:15

6 votes

Complex analysis in theoretical computer science

answered Jan 14, 2013 at 19:47

6 votes

Efficiently computable function as a counter-example to Sarnak's Mobius conjecture

answered Dec 29, 2013 at 19:19

5 votes

Complex analysis in theoretical computer science

answered Feb 10, 2013 at 2:00

2 votes

Information Theory used to prove neat combinatorial statements?

answered Dec 22, 2022 at 9:07

Stack Exchange Network

31 Answers

What would it mean to disprove Church-Turing thesis?

Applications of TCS to classical mathematics?

Coloring Planar Graphs

Should we consider $\mathsf{P} \neq \mathsf{NP}$ a law of nature?

Complex analysis in theoretical computer science

Quantum computing project ideas

Major unsolved problems in theoretical computer science?

Overarching reasons why problems are in P or BPP

Examples of the price of abstraction?

Intractability of NP-complete problems as a principle of physics?

Suppose $\mathbf{P} = \mathbf{BQP}$. Then what is randomness? Would it even exist at all?

Reasons for which a graph may be not $k$ colorable?

Applications of representation theory of the symmetric group

Conjectures implying Four Color Theorem

Reasons for which a graph may be not $k$ colorable?

Extension to the Stable Marriage Problem ?

Applications of TCS to classical mathematics?

The cozy neighborhoods of "P" and of "NP-hard"

Are edge-vertex graphs of polytopes (decent) expanders?

Maximal/maximum independent sets

Examples in which the size of the alphabet ($\geq 2$) used for an encoding matters

Are all the functions whose fourier weight is concentrated on the small sized sets computed by AC0 circuits?

Rigour leading to insight

Applications of TCS to classical mathematics?

Using error-correcting codes in theory

Information Theory used to prove neat combinatorial statements?

Complex analysis in theoretical computer science

Efficiently computable function as a counter-example to Sarnak's Mobius conjecture

Complex analysis in theoretical computer science

Information Theory used to prove neat combinatorial statements?