user avatar
user avatar
user avatar
smapers
  • Member for 3 years, 7 months
  • Last seen this week
10 votes
Accepted

The complexity of the permanent of low rank matrices

5 votes

Quantum evasiveness conjecture?

4 votes
Accepted

What is 'circuit problem' mentioned in Kempe-Kitaev-Regev's local hamiltonian problem paper

3 votes
Accepted

Min Cut with Vertices

3 votes
Accepted

Complexity of finding the most likely edge

3 votes
Accepted

Problem conditions to use Laplacian solvers

3 votes
Accepted

Is there a regular bipartite graph where the minimum cuts are trivial?

3 votes
Accepted

Reachability Query for Tree

2 votes

Computational hardness for sampling a uniform matching

2 votes
Accepted

Compiling einstein sums optimally

2 votes

What are the general direction and target question in the field of quantum error correction?

2 votes
Accepted

Google quantum supremacy experiment data

1 vote
Accepted

Fast Computation of First k Eigenvectors of Graph Laplacian

1 vote
Accepted

When can partial spectral sparsifiers be combined?

1 vote
Accepted

weights in low density codes

0 votes

On the coloring number of small graphs with small cliques

0 votes
Accepted

Graph path problem