New posts in computational-complexity

Big-O and function composition

MIN-FORMULA $\in$ NP

Complexity of the algorithms for Singular Value Decomposition

How to generate a random preference relation on a finite set uniformly?

Meaning of "polynomially larger"

What is the computational complexity of linear programming?

Newton form vs. Lagrange form for interpolating polynomials

If $P \ne NP$, is every language not contained in $NP$ $NP$-hard?

What is the significance of the graph isomorphism problem?

Algorithm to check whether a graph has no cycles

A computer's memory is finite, so how can there be languages more powerful than regular?

Does there exist a computable function that grows faster than fast growing hierarchy?

Algorithm to multiply nimbers

Number of orderings of subset sums

Is there a theory that combines category theory/abstract algebra and computational complexity?

In terms of complexity, is there a quicker way of checking if a matrix is nonsingular than computing the determinant?

Optimizing computational-complexity of linear-algebraic operations

Algorithm to compute the area of a convex set in 2 dimensions

Evaluating the sum $\sum_{i=1}^n i^2\cdot\lfloor{\frac ni}\rfloor$

Could someone prove they had a halting oracle?