New posts in complexity-theory

Can an O(n) algorithm ever exceed O(n^2) in terms of computation time?

big-o complexity-theory time-complexity

Sorting algorithms for data of known statistical distribution?

algorithm performance sorting statistics complexity-theory

Is list::size() really O(n)?

c++ list stl complexity-theory big-o

What is the complexity of this simple piece of code?

java complexity-theory big-o time-complexity stringbuffer

Explain the proof by Vinay Deolalikar that P != NP [closed]

math computer-science complexity-theory proof p-np

General rules for simplifying SQL statements

sql logic complexity-theory reduction

Why SortedSet<T>.GetViewBetween isn't O(log N)?

c# .net complexity-theory sortedset

Difference between O(n) and O(log(n)) - which is better and what exactly is O(log(n))?

algorithm data-structures complexity-theory big-o logarithm

Time complexity of unshift() vs. push() in Javascript

javascript arrays time push complexity-theory

multiset, map and hash map complexity

c++ complexity-theory big-o

Sorting in linear time? [closed]

algorithm sorting complexity-theory time-complexity

Example of O(n!)?

java algorithm big-o complexity-theory factorial

O(N log N) Complexity - Similar to linear?

language-agnostic complexity-theory quicksort

How to understand the knapsack problem is NP-complete?

algorithm complexity-theory

What is O(log* N)?

algorithm math complexity-theory logarithm iterated-logarithm

Programmatically obtaining Big-O efficiency of code

algorithm complexity-theory

What is the complexity of regular expression?

regex complexity-theory big-o

Why is the knapsack problem pseudo-polynomial?

language-agnostic complexity-theory dynamic-programming knapsack-problem

What's the Time Complexity of Average Regex algorithms?

regex algorithm complexity-theory

Is Big O(logn) log base e?

math binary-tree complexity-theory big-o