Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

New posts in complexity-theory

Is this NP-Hard or does a known optimal polynomial time solution exist?

algorithm complexity-theory

Order Complexity for Ruby Combinatoric Functions

ruby algorithm big-o complexity-theory

Time complexity of a recursive function with two calls

python complexity-theory time-complexity

Count the number of appearances of a value in a sorted array in O(log n) complexity

java arrays algorithm search complexity-theory

Are lower-bounds established by reductions tight?

algorithm computer-science complexity-theory reduction

complexity analysis of linear search in sorted array

arrays data-structures time-complexity complexity-theory linear-search

Divide N people into K groups: Why is the big O of this algorithim O(N^2 * K)?

java algorithm recursion dynamic-programming complexity-theory

Is this function in the complexity?

complexity-theory

Computational complexity of recursion in prolog

prolog complexity-theory failure-slice

Is complexity O(log(n) + log(n/2) + log(n/4) + log(n/8) + ... + log(2)) = O(log(n))?

algorithm complexity-theory

How to find all table references from Oracle 10G PL/SQL functions and procedures? [duplicate]

sql oracle-database plsql oracle10g complexity-theory

Explain why this unsimplified complexity expression is this?

c++ algorithm time-complexity complexity-theory

Intersection of n rectangles - Maximum number of regions where exactly k rectangles intersect

algorithm geometry complexity-theory computational-geometry

Is ϴ(n)/n = ϴ(1)?

algorithm big-o computer-science complexity-theory

Is a lookup in a hash table O(1)?

complexity-theory

Interesting recursive function

algorithm recursion complexity-theory

If algorithm time complexity is theta(n^2), is it possible that for one input it will run in O(n)?

complexity-theory time-complexity big-o

Comparison between two different merge sort implementations explained

python complexity-theory mergesort

algorithm to find ten integers>0 that sum to 2011 but their reciprocals sum to 1

algorithm complexity-theory dynamic-programming number-theory
Older Entries »