User David Harris

15 votes

Why are so few operations with arity bigger than 2?

answered Dec 14, 2010 at 22:02

10 votes

Philosophical Question related to Largest Known Primes

answered Apr 26, 2011 at 16:59

9 votes

What notions are used but not clearly defined in modern mathematics?

answered Feb 27, 2011 at 18:07

7 votes

What are the external triumphs of matroid theory?

answered May 4, 2011 at 19:14

7 votes

Accepted

name for $\underset{x}{\operatorname{argmin}} \displaystyle\sum\limits_{i=1}^n |x_i - x|$

answered Jul 2, 2011 at 9:09

7 votes

Nice examples/arguments that illustrating the coupling method in probability theory

answered Mar 15, 2014 at 1:17

6 votes

Is P=NP relevant to finding proofs of everyday mathematical propositions?

answered Dec 2, 2010 at 0:37

5 votes

Are there examples of nonconstructive metaproofs?

answered Jun 8, 2011 at 15:48

5 votes

Abstract notion for energy complexity of computational problems?

answered Jan 20, 2011 at 16:45

5 votes

Accepted

Lower Bound on the Cost of Solving Linear System

answered Jan 19, 2011 at 23:23

4 votes

How do they verify a verifier of formalized proofs?

answered Jan 8, 2011 at 22:11

4 votes

Can finitely many values of a polynomial determine it?

answered Jan 20, 2011 at 19:35

4 votes

Nice examples/arguments that illustrating the coupling method in probability theory

answered Mar 15, 2014 at 1:20

4 votes

Blackbox Theorems

answered Jun 15, 2012 at 2:20

3 votes

Which Turing machines accept the language of trivial words in a finitely presented group?

answered May 27, 2011 at 14:06

3 votes

Graduate School

answered Jan 25, 2011 at 16:29

3 votes

We know that a permutation of N bits {0, 1}^N --> {0,1}^N can be computed by circuits of size O(n 2^n). But are there circuits that can be computed only by size O((n^2)(2^n) and not O(n 2^n)

answered Mar 10, 2011 at 13:38

3 votes

Graph properties: definability and decidability

answered Jan 9, 2011 at 2:25

3 votes

Bounding the roots of the sum of two polynomials

answered Oct 8, 2010 at 13:41

3 votes

Expressing a graph property with counting quantifiers

answered Oct 16, 2010 at 20:01

2 votes

Why is it OK to rely on the Fundamental Theorem of Arithmetic when using Gödel numbering?

answered Jan 29, 2011 at 22:06

2 votes

Accepted

Godel 's Ladder: Undecidable PI_N sentences for N =2, 3, ......

answered Jun 23, 2012 at 13:36

2 votes

Random versions of deterministic problems

answered May 20, 2011 at 16:59

1 vote

Accepted

Proof that any NP problem can be reduced (in P time) to any problem in NPC?

answered Jun 16, 2011 at 17:35

1 vote

Statistics - Subpopulation Random Sampling

answered Jun 21, 2011 at 18:02

1 vote

2d moment of chebyshev

answered Dec 2, 2011 at 13:44

1 vote

Accepted

Standard Deviation of Averages of Random Numbers

answered May 31, 2011 at 18:55

1 vote

Finite graphs that realize all types over $n$-element sets

answered May 11, 2011 at 19:01

1 vote

Question on Maximum Likelihood Estimation

answered Mar 31, 2011 at 20:29

1 vote

Accepted

Equivalence of monadic axioms

answered Mar 18, 2011 at 16:41

Stack Exchange Network

37 Answers

Why are so few operations with arity bigger than 2?

Philosophical Question related to Largest Known Primes

What notions are used but not clearly defined in modern mathematics?

What are the external triumphs of matroid theory?

name for $\underset{x}{\operatorname{argmin}} \displaystyle\sum\limits_{i=1}^n |x_i - x|$

Nice examples/arguments that illustrating the coupling method in probability theory

Is P=NP relevant to finding proofs of everyday mathematical propositions?

Are there examples of nonconstructive metaproofs?

Abstract notion for energy complexity of computational problems?

Lower Bound on the Cost of Solving Linear System

How do they verify a verifier of formalized proofs?

Can finitely many values of a polynomial determine it?

Nice examples/arguments that illustrating the coupling method in probability theory

Blackbox Theorems

Which Turing machines accept the language of trivial words in a finitely presented group?

Graduate School

We know that a permutation of N bits {0, 1}^N --> {0,1}^N can be computed by circuits of size O(n 2^n). But are there circuits that can be computed only by size O((n^2)(2^n) and not O(n 2^n)

Graph properties: definability and decidability

Bounding the roots of the sum of two polynomials

Expressing a graph property with counting quantifiers

Why is it OK to rely on the Fundamental Theorem of Arithmetic when using Gödel numbering?

Godel 's Ladder: Undecidable PI_N sentences for N =2, 3, ......

Random versions of deterministic problems

Proof that any NP problem can be reduced (in P time) to any problem in NPC?

Statistics - Subpopulation Random Sampling

2d moment of chebyshev

Standard Deviation of Averages of Random Numbers

Finite graphs that realize all types over $n$-element sets

Question on Maximum Likelihood Estimation

Equivalence of monadic axioms