Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in complexity-theory

Time and space complexity of vector dot-product computation

What are the consequences of saying a non-deterministic Turing Machine can solve NP in polynomial time?

Big O for worst-case running time and Ω is for the best-case, but why is Ω used in worst case sometimes?

Are there O(1) random access data structures that don't rely on contiguous storage?

Is it possible to implement quicksort with O(1) space complexity?

Can the bigO of an algorithm be found programmatically by analyzing its perfs?

Comparison of experimental running time of algorithm vs. theoretical running time functions

Why is the Ackermann function related to the amortized complexity of union-find algorithm used for disjoint sets?

f(n)=n^log(n) complexity polynomial or exponential

The complexity of verifying solutions to NP-hard optimization problems?

What is the best complexity of N-Queens puzzle?

new BigInteger(String) performance / complexity

C++0x issue: Constant time insertion into std::set

"K-transformed" permutations

Why does decreasing K in K-nearest-neighbours increase complexity?

Clarification of statement of performance of collection's binary search from javadoc

Simple "maximum value in array" and complexity calculations

Meaning of average complexity when using Big-O notation