Newbetuts

Efficient computation of $E\left[\left(1+X_1+\cdots+X_n\right)^{-1}\right]$ with $(X_i)$ independent Bernoulli with varying parameter

Can one capture the properties of Turing machine using only function definitions?

Approximation of combination $ {n \choose k} = \Theta \left( n^k \right) $?

Does the Riemann hypothesis guarantee that integer factorization is difficult?

A communication complexity problem for finding near matches

Is there any infinite set of primes for which membership can be decided quickly?

How can I intuit the role of the central limit theorem in breaking the curse of dimensionality for Monte Carlo integration

Time complexity of variation on Coupon's collector problem

Complexity of counting the number of triangles of a graph

If an unary language exists in NPC then P=NP

Eigenvalue test faster than $O\left(n^3\right)$?

Are the primes compressible?

Difference between $\log n$ and $\log^2 n$

Minimum distance of a binary linear code

Minimum number of different clues in a Sudoku

How do we know that the P versus NP problem is an NP problem itself?

Can we prove that to prove P != NP is NP-Complete.

New posts in computational-complexity

The mother of all undecidable problems

Orders of Growth between Polynomial and Exponential

The tricky time complexity of the permutation generator

Efficient computation of $E\left[\left(1+X_1+\cdots+X_n\right)^{-1}\right]$ with $(X_i)$ independent Bernoulli with varying parameter

Can one capture the properties of Turing machine using only function definitions?

Approximation of combination $ {n \choose k} = \Theta \left( n^k \right) $?

Does the Riemann hypothesis guarantee that integer factorization is difficult?

A communication complexity problem for finding near matches

Is there any infinite set of primes for which membership can be decided quickly?

How can I intuit the role of the central limit theorem in breaking the curse of dimensionality for Monte Carlo integration

Time complexity of variation on Coupon's collector problem

Complexity of counting the number of triangles of a graph

If an unary language exists in NPC then P=NP

Eigenvalue test faster than $O\left(n^3\right)$?

Are the primes compressible?

Difference between $\log n$ and $\log^2 n$

Minimum distance of a binary linear code

Minimum number of different clues in a Sudoku

How do we know that the P versus NP problem is an NP problem itself?

Can we prove that to prove P != NP is NP-Complete.