User t24akeru

12 votes

3 answers

3k views

How can I quickly judge whether matrix A is the inverse matrix of B?

asked May 27, 2021 at 9:37

1 vote

2 answers

104 views

How to find infinite set $X$, which satisfies $T(n)=Ω(n)$ when $n∈X$

asked Mar 4, 2021 at 2:19

1 vote

1 answer

643 views

How to prove that one problem belongs to class P?

asked Apr 15, 2021 at 11:39

0 votes

1 answer

76 views

Is $\Pi’\propto_{poly}\Pi$ for any two NP-complete problems $\Pi,\Pi'$?

asked Apr 17, 2021 at 9:20

0 votes

1 answer

343 views

Prove NLOGSPACE$\subset$PSPACE

asked Apr 24, 2021 at 0:58

0 votes

1 answer

529 views

Time complexity of $L=\{a^nb^n | n \ge 1\}$

asked Apr 25, 2021 at 9:45

0 votes

0 answers

250 views

How to prove that the lower bound of the Huffman coding problem is $\Omega(n \log n)$?

asked Apr 29, 2021 at 8:05

0 votes

1 answer

477 views

How to find i largest numbers in unsorted array in O(n) where i <= n^(1/2)

asked Mar 27, 2021 at 2:19

0 votes

2 answers

347 views

How to get the expected time complexity of while loop?

asked May 29, 2021 at 10:02

0 votes

0 answers

30 views

Why is $\log n = O(n)$? [duplicate]

asked Jun 20, 2021 at 2:23

0 votes

2 answers

674 views

Does the O(n) algorithm always run faster than the O(n^3) algorithm? Why?

asked Feb 27, 2021 at 10:32

Stack Exchange Network

11 Questions

How can I quickly judge whether matrix A is the inverse matrix of B?

How to find infinite set $X$, which satisfies $T(n)=Ω(n)$ when $n∈X$

How to prove that one problem belongs to class P?

Is $\Pi’\propto_{poly}\Pi$ for any two NP-complete problems $\Pi,\Pi'$?

Prove NLOGSPACE$\subset$PSPACE

Time complexity of $L=\{a^nb^n | n \ge 1\}$

How to prove that the lower bound of the Huffman coding problem is $\Omega(n \log n)$?

How to find i largest numbers in unsorted array in O(n) where i <= n^(1/2)

How to get the expected time complexity of while loop?

Why is $\log n = O(n)$? [duplicate]

Does the O(n) algorithm always run faster than the O(n^3) algorithm? Why?