Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in complexity-theory

Data structure for O(log N) find and update, considering small L1 cache

No O(1) operation to join elements from two forward_lists?

c++ complexity-theory c++11

Quickly checking if set is superset of stored sets

Algorithmic complexity of PHP function strlen()

Do C & C++ compilers optimize comparisons with function calls?

Why is bubble sort O(n^2)?

Where can I find the time and space complexity of the built-in sequence types in Python

Why is the complexity of A* exponential in memory?

Is O(log n) always faster than O(n)

Why are NP problems called that way (and NP-hard and NP-complete)?

What is the lookup time complexity of HashSet<T>(IEqualityComparer<T>)?

Understanding Ukkonen's algorithm for suffix trees [duplicate]

Can OSGi help reduce complexity?

Check connection between two points on 2D plane

How to calculate order (big O) for more complex algorithms (eg quicksort)

Can any finite bit string be found in pi within a reasonable amount of time? [closed]

Java CharAt() and deleteCharAt() performance

C++ set: counting elements less than a value

NP-hard problems that are not NP-complete are harder?

e-commerce: Algorithm for calculating discounts