narek Bojikian
  • Member for 3 years, 11 months
  • Last seen this week
  • Berlin, Deutschland
2 answers
60 votes
9k views
25 bookmarks
Are there subexponential-time algorithms for NP-complete problems?
0 answers
37 votes
563 views
8 bookmarks
Finding an $st$-path in a planar graph which is adjacent to the fewest number of faces
5 answers
24 votes
8k views
9 bookmarks
P = NP clarification
0 answers
20 votes
615 views
4 bookmarks
Complexity of deciding whether there is a winning strategy in the following game
5 answers
19 votes
16k views
4 bookmarks
Maximum Independent Set of a Bipartite Graph
2 answers
15 votes
28k views
8 bookmarks
Finding shortest and longest paths between two vertices in a DAG
1 answers
11 votes
413 views
5 bookmarks
How fast can we compute the size of maximum matching in an unweighted bipartite graph?
0 answers
11 votes
168 views
4 bookmarks
Covering a complete graph with n copies of an arbitrary graph: NP-complete?
0 answers
10 votes
224 views
3 bookmarks
Minimum edge deletion partitioning of a planar graph
2 answers
9 votes
511 views
5 bookmarks
Subset sum problem for permutations
1 answers
9 votes
387 views
3 bookmarks
Shortest Path in a Directed Acyclic Graph with two types of costs
0 answers
8 votes
159 views
4 bookmarks
MST with possibly minimal diameter
2 answers
8 votes
1k views
2 bookmarks
Find a path from s to t using as few red nodes as possible
2 answers
8 votes
2k views
2 bookmarks
Length of strings accepted by DFA
2 answers
8 votes
4k views
5 bookmarks
Graph 3-colorability is self-reducible
1 answers
7 votes
221 views
2 bookmarks
Number of maximal cliques in a ($2C_4$, $C_5$, $P_5$)-free graph
1 answers
7 votes
719 views
4 bookmarks
How to perform orthogonal check on two circular binary strings?
1 answers
7 votes
231 views
1 bookmarks
Winning strategy for a given game on graphs
3 answers
7 votes
258 views
1 bookmarks
Find vertices of a convex polytope, defined by intersecting half-spaces
2 answers
6 votes
1k views
1 bookmarks
Mathematical proof for why gradient descent algorithm always converges
0 answers
6 votes
138 views
2 bookmarks
NP-hardness of a special traveling salesman problem
1 answers
6 votes
1k views
2 bookmarks
Prove that the class of CFG languages that are closed under reversal is undecidable
0 answers
6 votes
162 views
1 bookmarks
Impossibility of certain type of tree traversal algorithm
1 answers
5 votes
2k views
4 bookmarks
Find all cycles through a given vertex
1 answers
5 votes
2k views
1 bookmarks
vertex cover reduction to subset sum
1 answers
5 votes
642 views
2 bookmarks
Assuming P != NP, what is the cardinality of the set of NP-Hard languages?
1 answers
5 votes
197 views
1 bookmarks
Algorithm for finding an irreducible kernel of a DAG in O(V*e) time, where e is number of edges in output
1 answers
5 votes
89 views
2 bookmarks
Understanding simulated annealing information theoretically
1 answers
5 votes
170 views
2 bookmarks
Is finding the minimum feedback arc set on graph with two outgoing arcs for each node np-complete?
2 answers
5 votes
160 views
3 bookmarks
Modifying digraph to make it strongly connected