User Rune

2 votes

Are there other nice math books close to the style of Tristan Needham?

answered Jul 16, 2010 at 2:07

1 vote

Decision problem restricted to inputs that satisfy some necessary condition.

answered Jul 12, 2010 at 20:14

3 votes

Do all uncountable sets contain elements with infinite Kolmogorov complexity?

answered Jul 12, 2010 at 17:23

47 votes

Do names given to math concepts have a role in common mistakes by students?

answered Jun 18, 2010 at 13:27

4 votes

Are there complexity classes with provably no complete problems?

answered Jun 14, 2010 at 3:25

7 votes

Can SAT be solved in time n^k, for a specific k?

answered Jun 10, 2010 at 13:21

17 votes

Are there complexity classes with provably no complete problems?

answered Jun 9, 2010 at 15:51

0 votes

Efficient way of determining isomorphism

answered May 3, 2010 at 23:45

3 votes

Is the Jaccard distance a distance?

answered Mar 13, 2010 at 19:47

3 votes

How important are publications for undergrads?

answered Jan 8, 2010 at 15:58

1 vote

Complexity class of problems solvable using Q&A site

answered Jan 8, 2010 at 4:04

-4 votes

What programming languages do mathematicians use?

answered Jan 8, 2010 at 3:28

9 votes

Accepted

BPP being equal to #P under Oracle

answered Jan 5, 2010 at 3:14

3 votes

How unhelpful is graph minors theorem?

answered Dec 31, 2009 at 20:31

5 votes

What practical applications does set theory have?

answered Jan 1, 2010 at 4:47

2 votes

Local-global approach to graph theory

answered Jan 1, 2010 at 0:11

0 votes

How to compute the rank of a matrix?

answered Nov 29, 2009 at 5:33

0 votes

Cocktail party math

answered Nov 13, 2009 at 23:27

0 votes

Where to find nice diagrams of trees and other graphs?

answered Nov 12, 2009 at 19:31

5 votes

Independence from Set Theory Axioms

answered Nov 10, 2009 at 20:10

2 votes

How do you keep your research notes organized?

answered Nov 8, 2009 at 23:04

11 votes

Discrete logs vs. factoring

answered Nov 4, 2009 at 0:07

1 vote

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

answered Nov 1, 2009 at 13:45

3 votes

Quantum Computing Complexity?

answered Nov 1, 2009 at 13:35

0 votes

Automatically updating PDF reader for Windows

answered Nov 1, 2009 at 13:24

45 votes

Colloquial catchy statements encoding serious mathematics

answered Nov 1, 2009 at 4:02

8 votes

Examples where Kolmogorov's zero-one law gives probability 0 or 1 but hard to determine which?

answered Oct 29, 2009 at 18:12

16 votes

What is the first interesting theorem in (insert subject here)?

answered Oct 24, 2009 at 23:51

14 votes

Most helpful math resources on the web

answered Oct 24, 2009 at 4:21

Stack Exchange Network

29 Answers

Are there other nice math books close to the style of Tristan Needham?

Decision problem restricted to inputs that satisfy some necessary condition.

Do all uncountable sets contain elements with infinite Kolmogorov complexity?

Do names given to math concepts have a role in common mistakes by students?

Are there complexity classes with provably no complete problems?

Can SAT be solved in time n^k, for a specific k?

Are there complexity classes with provably no complete problems?

Efficient way of determining isomorphism

Is the Jaccard distance a distance?

How important are publications for undergrads?

Complexity class of problems solvable using Q&A site

What programming languages do mathematicians use?

BPP being equal to #P under Oracle

How unhelpful is graph minors theorem?

What practical applications does set theory have?

Local-global approach to graph theory

How to compute the rank of a matrix?

Cocktail party math

Where to find nice diagrams of trees and other graphs?

Independence from Set Theory Axioms

How do you keep your research notes organized?

Discrete logs vs. factoring

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

Quantum Computing Complexity?

Automatically updating PDF reader for Windows

Colloquial catchy statements encoding serious mathematics

Examples where Kolmogorov's zero-one law gives probability 0 or 1 but hard to determine which?

What is the first interesting theorem in (insert subject here)?

Most helpful math resources on the web