List questions from computational-complexity

Published on 15 Apr 2026 - 9:39

52

Views

Show that a function is linear if and only if it is $\theta(n)$

Published on 14 Apr 2026 - 16:52

201

Views

Would undecidability of $P = NP$ imply its truth/falsity?

Published on 14 Apr 2026 - 11:32

27

Views

Is there a strongly connected graph where 2 vertices exist such that random walk from one to another requires more than polynomial time?

Published on 14 Apr 2026 - 4:47

98

Views

The complexity of a variant algorithm for the Travelling Salesman Problem (TSP)

Published on 12 Apr 2026 - 14:57

244

Views

How many ways we can partition a multiset, where each part/segment in the partition has distinct elements?

Published on 15 Apr 2026 - 21:42

28

Views

Language of all graphs that have diameter larger than $\frac{n}{2}$

Published on 15 Apr 2026 - 3:29

219

Views

Find efficient way to generate all solutions to Diophantine equation $a^2+5ab+3b^2-c^2=0$ under a given bound $N$

Published on 11 Apr 2026 - 13:15

39

Views

Is $b^{m+1} = O(b^m)$

Published on 16 Apr 2026 - 3:44

94

Views

Unsatisfying proof for NP-Problems

Published on 10 Apr 2026 - 23:40

120

Views

Count number of solution to Diophantine equation $k_1a^2+k_2ab+k_3b^2-k_4c^2=0$

Published on 15 Apr 2026 - 8:41

425

Views

Complexity of differentiation (numeric vs. automatic/algorithmic).

Published on 11 Apr 2026 - 2:10

29

Views

What does it mean for a language L to be recognisable in polynomial time?

Published on 12 Apr 2026 - 10:31

List Question

Time complexity of a function

Show that a function is linear if and only if it is $\theta(n)$

Would undecidability of $P = NP$ imply its truth/falsity?

Is there a strongly connected graph where 2 vertices exist such that random walk from one to another requires more than polynomial time?

The complexity of a variant algorithm for the Travelling Salesman Problem (TSP)

How many ways we can partition a multiset, where each part/segment in the partition has distinct elements?

Language of all graphs that have diameter larger than $\frac{n}{2}$

Find efficient way to generate all solutions to Diophantine equation $a^2+5ab+3b^2-c^2=0$ under a given bound $N$

Is $b^{m+1} = O(b^m)$

Unsatisfying proof for NP-Problems

Count number of solution to Diophantine equation $k_1a^2+k_2ab+k_3b^2-k_4c^2=0$

Complexity of differentiation (numeric vs. automatic/algorithmic).

What does it mean for a language L to be recognisable in polynomial time?

Trending Questions

Popular # Hahtags

Popular Questions