Computer Science
Narek Bojikian's user avatar
Narek Bojikian's user avatar
Narek Bojikian's user avatar
Narek Bojikian
  • Member for 5 years, 7 months
  • Last seen this week
  • Berlin, Deutschland
Profile Activity

137 Answers

Score Activity Newest
56 votes

Why is English not a regular language?

11 votes

Examples of simple/common problems with quadratic running time

9 votes
Accepted

Counting number of paths between two vertices in a DAG

7 votes
Accepted

Shortest paths between given red vertices and arbitrary blue vertices

7 votes

What is the point of traversing a binary tree in preoder, inorder or postorder?

6 votes
Accepted

Linear algorithm to measure how sorted an array is

5 votes

Being stuck and frustrated with my masters project

5 votes

Algorithm to find a set of nodes with a smaller set of neighbours in a bipartite graph

4 votes
Accepted

Exponential Time Hypothesis and the input size vs number of variables

4 votes

Relationship between the parameters tree width and the maximum degree

4 votes
Accepted

Sorting array of strings (with repetitions) according to a given ordering

4 votes
Accepted

one-to-many matching in bipartite graphs?

4 votes

Find expectation with Chernoff bound

4 votes

In place and Out place sorting meaning?

4 votes
Accepted

Optimal meeting point

4 votes
Accepted

An algorithm for topological sorting based on depth-first search: why do we need two tags?

4 votes
Accepted

How can Turing complete machines exist theoretically if the halting problem is undecidable

4 votes

NP-hard problems but only for n≥3

4 votes

How do I reduce subset sum to another problem in NP?

4 votes
Accepted

Winning strategy for a given game on graphs

3 votes
Accepted

Minimum edge weight k-exact cover with triangle inequality

3 votes
Accepted

Selecting elements from two arrays to get a target sum

3 votes
Accepted

If A and B are NP-complete, then A ∪ B need not be NP-complete

3 votes
Accepted

Given a DCEL, how do you identify the unbounded face

3 votes
Accepted

Fastest algorithm to find all the possible paths of length $n$ from a give node in a directed graph?

3 votes

Converting a greedy algorithm to a dynamic programming algorithm

3 votes
Accepted

Hitting Set Problem with non-minimal Greedy Algorithm

3 votes
Accepted

Prove np-hardness of dividing items from the lists

3 votes
Accepted

How to convert statement with the existential quantifier to statement with universal quantifier?

3 votes
Accepted

Find the smallest element greater than current element

1
2 3 4 5

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.