Newbetuts
.
New posts in computational-complexity
What is the relationship between ZFC and Turing machine?
logic
computational-complexity
computability
Definition of time-constructible function
computational-complexity
examples-counterexamples
Can an algorithm be faster than O(1)?
algorithms
computational-complexity
Finding the asymptotic behavior of the recurrence $T(n)=4T(\frac{n}{2})+n^2$ by using substitution method
algorithms
asymptotics
recurrence-relations
computational-complexity
recursive-algorithms
What does a pair of vertical pipes mean within a function, as related to computational complexity?
computer-science
computational-complexity
How to formulate the P v.s. NP problem as a formal statement inside the language of set theory?
elementary-set-theory
logic
computer-science
computational-complexity
Why is factorization of large number hard
number-theory
computational-complexity
primality-test
prime-twins
An algorithm for arbitrage in currency exchange
algorithms
graph-theory
computational-complexity
economics
Why isn't NP = coNP?
computer-science
computational-complexity
little O proof wrong approach
limits
asymptotics
computational-complexity
Cholesky of matrix plus identity
matrices
computational-complexity
matrix-decomposition
cholesky-decomposition
Must an algorithm that decides a problem in NP also produce a solution?
computational-complexity
np-complete
Does DTIME(O(n)) = REGULAR?
computer-science
computational-complexity
What is the complexity of succinct (binary) Nurikabe?
computer-science
puzzle
np-complete
computational-complexity
Is there an easy way to find the sign of the determinant of an orthogonal matrix?
linear-algebra
matrices
determinant
computational-complexity
orthogonality
Complexity of computing $ABx$ depends on the order of multiplication
linear-algebra
matrices
computational-complexity
Is precomputation of the prime-factor-decomposition feasible?
computational-complexity
prime-factorization
What is the time complexity of Euclid's Algorithm (Upper bound,Lower Bound and Average)?
algorithms
computational-complexity
Can some proof that $\det(A) \ne 0$ be checked faster than matrix multiplication?
linear-algebra
matrices
determinant
computational-complexity
How long can proofs be?
logic
computational-complexity
provability
Prev
Next