List questions from computational-complexity

Published on 01 Nov 2014 - 4:09

62

Views

Prove that $\log^\alpha n = o( a^n )$

Published on 01 Nov 2014 - 20:04

242

Views

Is there a problem more difficult than NP-complete in graph theory?

Published on 25 Mar 2026 - 19:02

235

Views

Are there problems known to be not in $P$ but not known to be outside $NP$?

Published on 04 Nov 2014 - 21:18

80

Views

How do I show that $\sum_{i=0}^n i^2 = O(n^3)$?

Published on 05 Nov 2014 - 17:09

271

Views

Why is Chaitin's constant absolutely normal?

Published on 26 Mar 2026 - 3:00

707

Views

Proof of why the partition function Z in probabilistic graphical models (PGM) is NP-complete

Published on 25 Mar 2026 - 19:03

58

Views

Time spent to sort $10^7$ records with insertion sort

Published on 09 Nov 2014 - 5:18

749

Views

Philosophical implications of P vs NP proof?

Published on 26 Mar 2026 - 6:25

1k

Views

Analyzing runtime of a nested for loop

Published on 09 Nov 2014 - 22:13

48

Views

Order of magnitudes comparisons

Published on 10 Nov 2014 - 14:58

583

Views

Proving Priority Queue Operations Are Omega(log n)

Published on 11 Nov 2014 - 1:09

1k

Views

Asymptotic relation between specific binomial coefficient and exponential function

Published on 11 Nov 2014 - 13:14

334

Views

Big O - arithmetic rules

Published on 12 Nov 2014 - 22:44

55

Views

Combinatorial search by testing sets with fixed number of elements

Published on 12 Nov 2014 - 23:18

List Question

Sum of the series of numbers in an array

Prove that $\log^\alpha n = o( a^n )$

Is there a problem more difficult than NP-complete in graph theory?

Are there problems known to be not in $P$ but not known to be outside $NP$?

How do I show that $\sum_{i=0}^n i^2 = O(n^3)$?

Why is Chaitin's constant absolutely normal?

Proof of why the partition function Z in probabilistic graphical models (PGM) is NP-complete

Time spent to sort $10^7$ records with insertion sort

Philosophical implications of P vs NP proof?

Analyzing runtime of a nested for loop

Order of magnitudes comparisons

Proving Priority Queue Operations Are Omega(log n)

Asymptotic relation between specific binomial coefficient and exponential function

Big O - arithmetic rules

Combinatorial search by testing sets with fixed number of elements

Trending Questions

Popular # Hahtags

Popular Questions