Computer Science
Nathaniel's user avatar
Nathaniel's user avatar
Nathaniel's user avatar
Nathaniel
  • Member for 5 years, 11 months
  • Last seen this week
  • Paris, France
Profile Activity

433 Answers

Score Activity Newest
2 votes
Accepted

Possible partitions, for k-means problem(k=2)

2 votes

Graph with $\Theta(2^n)$ minimum $(s, t)$-cuts

2 votes
Accepted

Prove the language $\{x \in \Sigma^* : \exists w \in \Sigma^* \ xww \in L \}$ for regular language $L$ is regular

2 votes
Accepted

Greedy Algorithm: Optimal Substructure

2 votes
Accepted

For a balanced binary search tree what is the worst case case time complexity for accessing all elements within a range of nodes?

2 votes
Accepted

Describe regular expression

2 votes
Accepted

Is the concatenation of a non-regular CFL and a complement of a regular upper-set always non-regular?

2 votes

Finding $Aeven(x)$ and $Aodd(x)$ for a Fast Fourier Transform (FFT) problem?

2 votes
Accepted

Disadvantages of Huffman Encoding

2 votes

Language for starting and ending with same symbol

2 votes
Accepted

How does Sipser's 0n1n PDA reject 0101?

2 votes
Accepted

Transitions of Turing machine in Cook Levin theorem proof

2 votes

Show that NL ⊆ P

2 votes
Accepted

Why do researchers only count the number of multiplications when analyse the time complexity of Matrix Multiplication?

2 votes
Accepted

Big o notation for sublinear algorithm in streaming algorithm

2 votes
Accepted

Can you have an approximation that is higher than the optimal for a maximum value and a lower than the optimal for a minimum value?

2 votes
Accepted

Multiplication of polynomials in value representation as done for Fast Fourier Transform

2 votes
Accepted

How can I make my algorithm more efficient?

2 votes
Accepted

Is there a bound on possible Dead state in a minimized DFA

2 votes
Accepted

while loop for bitwise conversion program

2 votes

Write the Context free Grammar

2 votes
Accepted

Reduction from Independent Set with fixed vertex to Independent Set

2 votes
Accepted

How do Kruskal's and Prim's algorithms compare to each other?

2 votes

What is the Number of Possible Nonequivalent Propositions with $P_1, P_2, P_3$ Using $\iff$ Operator?

2 votes
Accepted

In which reference can I find a definition for the equivalence of DFAs?

2 votes
Accepted

If a problem C is NP hard and there is an existing reduction from/to A,B,D, are they NP hard as well?

2 votes

How to prove the class of regular languages is closed under 3MAJ?

2 votes

How to find an array of probabilities that give equal products

2 votes

Is $\log(n-1) \in \Omega(\log(n))$?

2 votes

Converting along regular expression to NFA

1
…
3 4
5
6 7
…
15

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.