Wei Zhan's user avatar
Wei Zhan's user avatar
Wei Zhan's user avatar
Wei Zhan
  • Member for 9 years, 5 months
  • Last seen more than a week ago
10 votes
Accepted

If $A \cap B$ or $A \cup B$ or $A \times B$ is recursively enumerable is it true to say that both $A$ and $B$ are recursively enumerable?

9 votes
Accepted

Selling blocks of time slots

8 votes

Can two different complexity classes be equal relative to an oracle? Example request

7 votes
Accepted

Name of this rearranging/sorting problem?

4 votes

Find proportion of 'important' edge among all edges in a graph

4 votes

Is it possible to determine if C=A+B faster than adding A+B in logical circuits

4 votes
Accepted

Rearranging strings so that the Hamming distance between them is 1

4 votes

Find a subset in constant many queries

3 votes
Accepted

Is selecting some of the sets such that their intersection is of size k NP-hard?

3 votes

Shortest path between all pairs of vertices in cyclic undirected weighted sparse graph

3 votes

Binary search with alternative comparison cost

2 votes
Accepted

$m/p$-equivalence holds after union with an arbitrary finite language

2 votes
Accepted

Minimum Number of People Such That No Two People Know the Same Two People

2 votes
Accepted

What is tight NSPACE complexity of $ALT\text{-}SPACE(a(n),s(n))$?

2 votes

Between every two MST's there's a series of "nearby" MST's

2 votes
Accepted

Transforming an array into one with descending order

1 vote
Accepted

Hardness of checking maximal magnitude of a sum of a subset of vectors

1 vote
Accepted

maximizing inner product of vectors in an ellipsoid and a given vector

1 vote
Accepted

NP-hardness of finding a subset of vertices in a vertex-weighted graph