Skip to main content
OverflowAI is here! AI power for your Stack Overflow for Teams knowledge community. Learn more
Gamow's user avatar
Gamow's user avatar
Gamow's user avatar
Gamow
  • Member for 9 years, 4 months
  • Last seen more than 2 years ago
6 votes
Accepted

On complexity of linear programming with quadratic equality/inequality constraints?

6 votes
Accepted

Complexity of Finding Largest Set of Intersecting Convex Polytopes

6 votes
Accepted

Minimal number of hyperplanes needed to separate sets of points from one other set

5 votes
Accepted

Satisfiability problems with restricted (not bounded) number of occurrences per variable

5 votes
Accepted

Complexity of computing the union of H-polytopes in three dimensions

5 votes
Accepted

Partition edges into edge disjoint walks

5 votes
Accepted

NP completeness of classes of spanning trees

5 votes
Accepted

Deciding CL-IS on graph efficiently

5 votes

Deciding $\omega(G)>k$ when $\alpha(G)$ and $\chi(G)$ have bounds and are known

5 votes
Accepted

CFGs in a certain normal form

5 votes

Is the max cut problem still NP-Complete for graphs with unit weights on the edges?

5 votes
Accepted

Maximum number of geometrically disjoint paths - is the complexity known?

4 votes
Accepted

Stackelberg solution to $n$-player Hotelling's game on a segment

4 votes

Euclidean TSP in NP and square root complexity

4 votes

How to solve the Shortest Hamiltonian Path problem on Sparse Graphs?

4 votes

$k$-clique in $k$-partite graph

4 votes

Is finding a solution harder than verifying a solution?

4 votes

A least sized partition of a set under a distance metric

4 votes
Accepted

Minimizing a convex piece-wise linear function of short $(\max, +)$ circuit length

4 votes
Accepted

Minimum relevant variables in linear system - additive approximation

4 votes

Graph classes where giving a q-clique edge cover makes testing for q-colouring easy

4 votes

Disjoint subsets problem complexity

3 votes
Accepted

Is partitioning a multiset into two multisets with equal averages NP-complete?

3 votes
Accepted

Is S-T CONNECTEDNESS #P-complete on instances when all s-t paths are of the same length?

3 votes

A partition problem in which some numbers may be cut

3 votes
Accepted

3 dimensional matching shortest solution NP-hard?

3 votes

Minimum number of columns making each row different

3 votes

Maximal non-reducible vertex cover of a graph

3 votes
Accepted

Assignment problem with multiple workers for each job

3 votes

Graph coloring/partitioning problem