Skip to main content
Steven's user avatar
Steven's user avatar
Steven's user avatar
Steven
  • Member for 11 years, 4 months
  • Last seen more than a month ago
29 votes
Accepted

Data structure for fast insertion and fast random element removal

23 votes
Accepted

Algorithm for merging arrays while keeping their order

22 votes
Accepted

Are all Integer Linear Programming problems NP-Hard?

17 votes
Accepted

How is the problem, {⟨G⟩|G has no triangle} in Logspace?

17 votes

Is $\{w_1xw_2\mid w_1,w_2\in \{a,b\}^* \text{ and } x \in \{a,b\}\}$ regular or not?

14 votes

Time Complexity of Linear Search vs Brute Force

14 votes
Accepted

Can any problem in P be converted to any other problem in P in polynomial time?

12 votes
Accepted

I have found an example where regular expression is not closed under concatenation. Where am I wrong?

12 votes
Accepted

Proof that for 2n nodes of +1 and -1 position doesn't count

11 votes
Accepted

Why does the order of the nested loops matter when solving the Coin Change problem?

11 votes
Accepted

Are there problems in NP that do not reduce in polynomial time to any problem in NP?

9 votes

Find the number using binary search against one possible lie

8 votes

Two regular languages over the same alphabet, regular or not regular?

8 votes

What are you allowed to move into the big O notation for it to be still correct?

8 votes
Accepted

Asymptotics of the sum of a geometric series

7 votes
Accepted

Faster algorithm for a specific inversion

7 votes
Accepted

Why is $\log n+\log \frac{n}{2}+\log \frac{n}{4}+\log \frac{n}{8}+\cdots+\log \frac{n}{n}=\Theta (\log^2 n)$?

7 votes
Accepted

Proof that $P\subseteq NP$ without nondeterministic TM

7 votes
Accepted

Irregularity of $\{ w_1 aa w_2 \mid |w_1| \neq |w_2| \}$

6 votes
Accepted

Why does the Huffman coding algorithm produce a valid tree?

6 votes
Accepted

Is this clique algorithm in polynomial time correct or might it have another time complexity?

6 votes
Accepted

Diameter of a disconnected graph

6 votes
Accepted

Could anyone prove why O(n^(log n)) < O((log n)^n)?

6 votes

Can Turing Machines solve non-decision problems?

6 votes
Accepted

Does this argument prove CFLs are not closed under union?

6 votes

Minimize edges of a directed unweighted graph

6 votes
Accepted

Find the power of 2

6 votes

Test if $ \sum_{n=0}^\infty \frac{n^2}{2^n} $ = O(1)

6 votes
Accepted

how can turing machines be universal models of computation if they can't perform binary search?

6 votes

Topological sort with minimum maximal distance in array

1
2 3 4 5
36