List questions from computational-complexity

Published on 25 Mar 2026 - 6:08

101

Views

Is there a logic more expressive than Default Logic?

Published on 11 Jul 2019 - 21:45

262

Views

What is the arithmetic cost (computational complexity) of an SDP with nonlinear matrix inequality constraint

Published on 26 Mar 2026 - 4:55

223

Views

Is the runtime complexity $Θ\left(n^2lg\ n\right)$ for this recurrence relation $T\left(n\right)\ =\ 4T\left(\frac{n}{2}\right)\ +\ n^2\sqrt{n}$?

Published on 16 Jul 2019 - 18:23

81

Views

What is the runtime complexity for this recurrence relation $T\left(n\right)\ =\ 2T\left(\frac{n}{2}\right)\ +\ n\ lg\ n$?

Published on 16 Jul 2019 - 19:08

140

Views

Most Computationally Speedy Algorithm To Multiply Two Matrices (not necessarily square matrices)

Published on 16 Jul 2019 - 23:04

119

Views

Is $n\ \log_2\left(n\right)\ ∈\ Ω\left(n^{1.001}\right)$?

Published on 17 Jul 2019 - 13:31

320

Views

Comparisons of Solving Speed of QP & SOCP

Published on 22 Mar 2026 - 18:02

82

Views

Estimate number of guesses for credentials

Published on 22 Jul 2019 - 14:19

154

Views

Clarification on the SAT problem

Published on 23 Jul 2019 - 22:30

73

Views

equivalent $NFA$s

Published on 25 Mar 2026 - 21:53

165

Views

Are there functions $f$ and $g$ such that $f \circ g$ is exponential even though neither $f$ nor $g$ is?

Published on 31 Jul 2019 - 13:03

502

Views

The polynomial algorithm to show that the Partition Problem belongs to the class of NP

Published on 25 Mar 2026 - 12:34

33

Views

Can we get a polynomial time algorithm from a naively exponential one, because of a linear formula that's bounded?

Published on 03 Aug 2019 - 0:48

83

Views

Clique enumeration for substring overlap graph surely has polynomial (not exponential) running time.

Published on 26 Mar 2026 - 19:17

List Question

Solving a multilinear system of equations

Is there a logic more expressive than Default Logic?

What is the arithmetic cost (computational complexity) of an SDP with nonlinear matrix inequality constraint

Is the runtime complexity $Θ\left(n^2lg\ n\right)$ for this recurrence relation $T\left(n\right)\ =\ 4T\left(\frac{n}{2}\right)\ +\ n^2\sqrt{n}$?

What is the runtime complexity for this recurrence relation $T\left(n\right)\ =\ 2T\left(\frac{n}{2}\right)\ +\ n\ lg\ n$?

Most Computationally Speedy Algorithm To Multiply Two Matrices (not necessarily square matrices)

Is $n\ \log_2\left(n\right)\ ∈\ Ω\left(n^{1.001}\right)$?

Comparisons of Solving Speed of QP & SOCP

Estimate number of guesses for credentials

Clarification on the SAT problem

equivalent $NFA$s

Are there functions $f$ and $g$ such that $f \circ g$ is exponential even though neither $f$ nor $g$ is?

The polynomial algorithm to show that the Partition Problem belongs to the class of NP

Can we get a polynomial time algorithm from a naively exponential one, because of a linear formula that's bounded?

Clique enumeration for substring overlap graph surely has polynomial (not exponential) running time.

Trending Questions

Popular # Hahtags

Popular Questions