List questions from computational-complexity

Published on 25 Mar 2026 - 17:43

378

Views

Prove that: $n^2+3n^3 + 6^{lgn} is $ $\theta(n^3)$

Published on 05 Feb 2016 - 0:37

111

Views

Math Contests: How to Solve Equation with $x$ in the Denominator

Published on 05 Feb 2016 - 2:39

3k

Views

Bubble sort complexity calculation, unsure how it went from one step to another.

Published on 05 Feb 2016 - 16:50

34

Views

Does there exist a $k$ such that for all $n \ge 3$, $\text{gpf}(\lfloor n^{(\log{n})^k} \rfloor) \gt n$?

Published on 05 Feb 2016 - 19:14

389

Views

Proving that one has solved chess by exhibiting the zeroes of polynomials over finite fields?

Published on 30 Mar 2026 - 14:43

859

Views

How to prove complexity of algorithms

Published on 10 Feb 2016 - 21:01

110

Views

does $f(n) = O(g(n))$ implies $(f(n))^{log(n)} = O((g(n))^{log(n)}) ?$

Published on 11 Feb 2016 - 23:49

358

Views

Structural Induction with Propositional Variables

Published on 12 Feb 2016 - 5:56

423

Views

Reduction to/from REC and RE language?

Published on 27 Mar 2026 - 23:01

248

Views

Need an example shows why SAT is NP problem

Published on 26 Mar 2026 - 19:38

219

Views

Complexity Of Recognising Complete Multipartite Graphs

Published on 16 Feb 2016 - 22:57

629

Views

Test symmetricity for a sparse matrix

Published on 18 Feb 2016 - 17:30

519

Views

Why does the cutting plane method for integer programming run in exponential time?

Published on 30 Mar 2026 - 2:10

3.6k

Views

Algorithmic time complexity of Newton's method vs bisection method

Published on 19 Feb 2016 - 5:47

List Question

How long does the General Number Field Sieve actually take?

Prove that: $n^2+3n^3 + 6^{lgn} is $ $\theta(n^3)$

Math Contests: How to Solve Equation with $x$ in the Denominator

Bubble sort complexity calculation, unsure how it went from one step to another.

Does there exist a $k$ such that for all $n \ge 3$, $\text{gpf}(\lfloor n^{(\log{n})^k} \rfloor) \gt n$?

Proving that one has solved chess by exhibiting the zeroes of polynomials over finite fields?

How to prove complexity of algorithms

does $f(n) = O(g(n))$ implies $(f(n))^{log(n)} = O((g(n))^{log(n)}) ?$

Structural Induction with Propositional Variables

Reduction to/from REC and RE language?

Need an example shows why SAT is NP problem

Complexity Of Recognising Complete Multipartite Graphs

Test symmetricity for a sparse matrix

Why does the cutting plane method for integer programming run in exponential time?

Algorithmic time complexity of Newton's method vs bisection method

Trending Questions

Popular # Hahtags

Popular Questions