Skip to main content
ErroR's user avatar
ErroR's user avatar
ErroR's user avatar
ErroR
  • Member for 3 years, 5 months
  • Last seen more than a week ago
17 votes
Accepted

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

7 votes
Accepted

Why are Regular sets not closed under infinite unions and intersections?

6 votes
Accepted

Time Complexity of Logarithmic For loop

5 votes
Accepted

What is the meaning of this symbol that looks like an inverted uppercase A?

4 votes

How to determine the approximation factor for greedy vertex cover algorithm?

3 votes

Examples of higher order algorithms ($\mathcal{O}(n^4)$ or larger)

3 votes

Kth largest element of a Min Heap of size K is always root element

3 votes

How does $Θ(\log(n!))=Θ(\log(n^n)$?

3 votes

Why is the time complexity of the Bit Manipulation solution to Binary Addition O(M + N)?

3 votes

Prove that $O(\sum_{i=0}^{h}{2^i\times(h-i)}) \sim O(2^h)$

2 votes

Special arcs - graph traversal

2 votes

Lower bound on worst-case time complexity of all sorting algorithms neglecting reading input and accessing elements time

2 votes
Accepted

Is $n\log_{2}\log_{2}n = O(n\log_{3}\log_{3}n)$?

2 votes
Accepted

Is 3-UNSAT problem coNP-complete?

2 votes

Dijkstra's algorithm in a weighted graph

2 votes
Accepted

Convert the given NFA to DFA

2 votes

Spanning tree whose sum of edge weights are between two boundries

2 votes

Is $\log^{*}(\log(n)) = \Theta (\log(\log^{*}(n)))$?

2 votes

What is the asymptotic bound for $T(n)= 3T(\sqrt[3]{n})+n^3$?

1 vote

Is $\frac{n}{\log n} \log \frac{n}{\log n} = O(n)$?

1 vote

Asymptotics of recurrence $f(x) = 8f(x/2) + O(1)$

1 vote

Having trouble calculating the asymptotic running time of MAX-HEAPIFY

1 vote

Solving $T(n) = 2T(\frac{n}{2}) + n\log(n)$ without master theorem

1 vote

Runtime of sorting algorithms given a particular input

1 vote

Union of non-context free languages

1 vote

Showing asymptotic lower bound on log of recurrence

1 vote
Accepted

When would it be optimal to use an Edge List as opposed to an Adjacency List / Matrix when representing a graph?

1 vote

Clarification on the algorithm for finding a majority element

1 vote

Find an upper bound for $T(n)=T(\sqrt{n})+10\log\log n$

1 vote

Difference between a regular and a non-regular language