List questions from computational-complexity

Published on 29 Dec 2013 - 21:07

426

Views

About theorem's proof length in propositional calculus

Published on 30 Mar 2026 - 14:54

546

Views

Implications of NP=coNP for PSPACE

Published on 05 Jan 2014 - 7:38

31

Views

NP-hardness of an Integer Program

Published on 30 Dec 2013 - 16:09

59

Views

Complexity of the Automorphism problem in group with polynomial growth.

Published on 08 Jan 2014 - 10:48

73

Views

Reference for problems without efficient algorithm (in polynomial time)

Published on 09 Jan 2014 - 16:57

326

Views

Prove that RE is closed under reduction

Published on 28 Mar 2026 - 15:19

176

Views

Complexity class with arithmetical oracle.

Published on 02 Apr 2026 - 22:34

215

Views

number of multiplication steps required to solve Ax = b

Published on 18 Jan 2014 - 10:40

6.3k

Views

Are all undecidable problems NP-Hard?

Published on 18 Jan 2014 - 15:34

37

Views

Showing for $f,g:\mathbb{R}\rightarrow\mathbb{R}$ that for $M>0, |f(x)|\le M|g(x)|$ for $x>x_0$

Published on 26 Mar 2026 - 12:37

1.2k

Views

How to show a function is negligible?

Published on 02 Apr 2026 - 15:37

59

Views

Do polynomial bounds on a function imply polynomial bounds on absolute value of the function?

Published on 19 Jan 2014 - 20:41

512

Views

Languages in P that are not P-complete

Published on 28 Mar 2026 - 15:27

89

Views

Correctness of complexity analysis of recursive algorithm

Published on 30 Mar 2026 - 11:10

List Question

Why is NP not equal to P^NP?

About theorem's proof length in propositional calculus

Implications of NP=coNP for PSPACE

NP-hardness of an Integer Program

Complexity of the Automorphism problem in group with polynomial growth.

Reference for problems without efficient algorithm (in polynomial time)

Prove that RE is closed under reduction

Complexity class with arithmetical oracle.

number of multiplication steps required to solve Ax = b

Are all undecidable problems NP-Hard?

Showing for $f,g:\mathbb{R}\rightarrow\mathbb{R}$ that for $M>0, |f(x)|\le M|g(x)|$ for $x>x_0$

How to show a function is negligible?

Do polynomial bounds on a function imply polynomial bounds on absolute value of the function?

Languages in P that are not P-complete

Correctness of complexity analysis of recursive algorithm

Trending Questions

Popular # Hahtags

Popular Questions