List questions from computational-complexity

Published on 04 Dec 2013 - 3:32

568

Views

What is the complexity of $\Theta((n^3)/(\log(n))^4)$ ? Or $\Theta(n \cdot (\log(n))^3)$?

Published on 06 Dec 2013 - 18:07

993

Views

Finding no-self-intersecting path in geometric graphs

Published on 02 Apr 2026 - 10:07

311

Views

Prove or disprove: $n\log ({2^n}\log ({n^2})) = O({n^2})$

Published on 07 Dec 2013 - 11:36

253

Views

Cover the n-sphere with sub-hemispherical caps

Published on 27 Mar 2026 - 12:17

149

Views

What is a power Delaunay triangulation, and how is it computed?

Published on 26 Mar 2026 - 17:31

108

Views

Question Understanding Simple Algebra With Regards to Computational Complexity

Published on 26 Mar 2026 - 14:40

296

Views

Word-chain game complexity

Published on 14 Dec 2013 - 20:48

136

Views

Why every regular language is in $\text{TIME}(n)$?

Published on 01 Apr 2026 - 10:21

449

Views

Is Quadratically Constrained Quadratic Program (QCQP) in NP?

Published on 25 Mar 2026 - 16:06

817

Views

What is the simplest collatz like problem that is undecidable?

Published on 29 Mar 2026 - 4:48

293

Views

Period of a multivariable function

Published on 22 Dec 2013 - 0:24

69

Views

I have an answer for an asymptotic analysis, which i cannot accept. please explain me where i go wrong.

Published on 25 Dec 2013 - 14:14

405

Views

np or np complete proof of a factory problem

Published on 27 Mar 2026 - 14:55

184

Views

Prove NP-Complete. $n$ clubs, largest has $m$ members. Hall Capacity is of $k$ guests. List $k$ students s. t. every club has atleast one member.

Published on 05 Apr 2026 - 21:09

List Question

Communication complexity example problem

What is the complexity of $\Theta((n^3)/(\log(n))^4)$ ? Or $\Theta(n \cdot (\log(n))^3)$?

Finding no-self-intersecting path in geometric graphs

Prove or disprove: $n\log ({2^n}\log ({n^2})) = O({n^2})$

Cover the n-sphere with sub-hemispherical caps

What is a power Delaunay triangulation, and how is it computed?

Question Understanding Simple Algebra With Regards to Computational Complexity

Word-chain game complexity

Why every regular language is in $\text{TIME}(n)$?

Is Quadratically Constrained Quadratic Program (QCQP) in NP?

What is the simplest collatz like problem that is undecidable?

Period of a multivariable function

I have an answer for an asymptotic analysis, which i cannot accept. please explain me where i go wrong.

np or np complete proof of a factory problem

Prove NP-Complete. $n$ clubs, largest has $m$ members. Hall Capacity is of $k$ guests. List $k$ students s. t. every club has atleast one member.

Trending Questions

Popular # Hahtags

Popular Questions