User Scott Aaronson

113 votes

The enigmatic complexity of number theory

answered Oct 6, 2017 at 19:22

104 votes

Intuitive crutches for higher dimensional thinking

answered Jul 16, 2010 at 22:21

53 votes

Accepted

How do we know that P != LINSPACE without knowing if one is a subset of the other?

answered Oct 1, 2010 at 16:27

47 votes

Nontrivial theorems with trivial proofs

answered May 25, 2011 at 3:56

44 votes

What is the easiest randomized algorithm to motivate to the layperson?

answered Sep 10, 2010 at 12:35

28 votes

Are there any interesting examples of random NP-complete problems?

answered Jul 12, 2010 at 21:17

25 votes

Problems known to be in both NP and coNP, but not known to be in P

answered Jul 17, 2010 at 20:35

25 votes

Philosophical Question related to Largest Known Primes

answered Apr 25, 2011 at 20:24

25 votes

What are some examples of ingenious, unexpected constructions?

answered Aug 25, 2012 at 2:43

25 votes

When has discrete understanding preceded continuous?

answered May 29, 2017 at 3:53

21 votes

Massive cancellations

answered Nov 27, 2014 at 4:06

18 votes

Is all non-convex optimization heuristic?

answered Jul 20, 2010 at 4:12

18 votes

What are some applications of other fields to mathematics?

answered Jul 25, 2010 at 16:21

18 votes

Accepted

What's known about the relationship about EQP and BQP?

answered Oct 1, 2010 at 19:50

12 votes

Accepted

"psi-epistemic theories" in 3 or more dimensions

answered May 2, 2012 at 8:43

11 votes

Generating Hard Instances

answered Jun 26, 2014 at 17:16

9 votes

Accepted

Saying things rapidly about integer factorisations

answered Aug 5, 2012 at 19:56

9 votes

Decomposing a finite group as a product of subsets

answered May 29, 2017 at 4:45

8 votes

Blackbox Theorems

answered Jun 18, 2012 at 17:10

8 votes

Accepted

Do all uncountable sets contain elements with infinite Kolmogorov complexity?

answered Aug 1, 2012 at 15:07

8 votes

Accepted

Minimum number of variables on which a multivariate polynomial depends?

answered Apr 7, 2014 at 17:45

6 votes

Accepted

Is there a promise version of 3-coloring equivalent to Graph Isomorphism?

answered Jul 12, 2010 at 20:15

5 votes

Examples of using physical intuition to solve math problems

answered Jun 22, 2017 at 19:37

4 votes

Review of Tim Maudlin's New Foundations for Physical Geometry

answered Jun 18, 2014 at 1:00

Stack Exchange Network

24 Answers

The enigmatic complexity of number theory

Intuitive crutches for higher dimensional thinking

How do we know that P != LINSPACE without knowing if one is a subset of the other?

Nontrivial theorems with trivial proofs

What is the easiest randomized algorithm to motivate to the layperson?

Are there any interesting examples of random NP-complete problems?

Problems known to be in both NP and coNP, but not known to be in P

Philosophical Question related to Largest Known Primes

What are some examples of ingenious, unexpected constructions?

When has discrete understanding preceded continuous?

Massive cancellations

Is all non-convex optimization heuristic?

What are some applications of other fields to mathematics?

What's known about the relationship about EQP and BQP?

"psi-epistemic theories" in 3 or more dimensions

Generating Hard Instances

Saying things rapidly about integer factorisations

Decomposing a finite group as a product of subsets

Blackbox Theorems

Do all uncountable sets contain elements with infinite Kolmogorov complexity?

Minimum number of variables on which a multivariate polynomial depends?

Is there a promise version of 3-coloring equivalent to Graph Isomorphism?

Examples of using physical intuition to solve math problems

Review of Tim Maudlin's New Foundations for Physical Geometry