List questions from computational-complexity

Published on 22 Mar 2017 - 9:52

42

Views

Proving that a holomorphic function has a constant Re part if certain conditions are fulfilled

Published on 22 Mar 2017 - 13:04

42

Views

Class of languages able to be recognized equal to $\text{P}/\text{poly}$?

Published on 26 Mar 2026 - 22:13

704

Views

Check if modified Turing Machine is equivalent to regular Turing Machine

Published on 26 Mar 2026 - 22:12

350

Views

P $\neq$ NP via Time Hierarchy Theorem?

Published on 26 Mar 2026 - 12:34

1.2k

Views

A one-tape Turing machine which operates in linear time can only recognize a regular language

Published on 26 Mar 2026 - 22:17

1k

Views

Improper proof that $P \neq NP$

Published on 26 Mar 2017 - 17:56

131

Views

finding where is a function complex differentiable and holomorphic

Published on 28 Mar 2017 - 7:28

50

Views

Proving $\log(n+k)$ is $O(log(n))$ for an arbitrary constant $k$?

Published on 29 Mar 2017 - 1:33

276

Views

Polynomial Time Decision Problems and P $\neq$ NP

Published on 26 Mar 2026 - 7:57

2.8k

Views

Reference For Complexity of Optimization Algorithms

Published on 31 Mar 2017 - 22:39

117

Views

Time complexity of finding negative elements of doubly sorted matrix

Published on 28 Mar 2026 - 6:07

1.8k

Views

Time complexity of some matrix multiplication

Published on 03 Apr 2017 - 20:22

48

Views

Can we check efficiently whether a given integer solution of a Mordell-curve is the smallest?

Published on 24 Mar 2026 - 23:45

52

Views

Proving a graph (that has $n$ vertices and contains an $n$-clique) is in $P$?

Published on 05 Apr 2017 - 22:24

List Question

time complexity for my function

Proving that a holomorphic function has a constant Re part if certain conditions are fulfilled

Class of languages able to be recognized equal to $\text{P}/\text{poly}$?

Check if modified Turing Machine is equivalent to regular Turing Machine

P $\neq$ NP via Time Hierarchy Theorem?

A one-tape Turing machine which operates in linear time can only recognize a regular language

Improper proof that $P \neq NP$

finding where is a function complex differentiable and holomorphic

Proving $\log(n+k)$ is $O(log(n))$ for an arbitrary constant $k$?

Polynomial Time Decision Problems and P $\neq$ NP

Reference For Complexity of Optimization Algorithms

Time complexity of finding negative elements of doubly sorted matrix

Time complexity of some matrix multiplication

Can we check efficiently whether a given integer solution of a Mordell-curve is the smallest?

Proving a graph (that has $n$ vertices and contains an $n$-clique) is in $P$?

Trending Questions

Popular # Hahtags

Popular Questions