delete000's user avatar
delete000's user avatar
delete000's user avatar
delete000
  • Member for 10 years, 11 months
  • Last seen this week
11 votes
1 answer
307 views

Fast classical simulation of quantum algorithms

8 votes
1 answer
291 views

How to benchmark #2-SAT counting algorithms?

6 votes
0 answers
125 views

Counting on grid graphs

5 votes
1 answer
206 views

Hashing-based vs almost uniform sampling-based approximate counting

5 votes
2 answers
316 views

Efficient way to generate random planar cubic bipartite graphs

5 votes
0 answers
87 views

Complexity of bounded degree full contraction

4 votes
0 answers
147 views

Reduce $m$-clause 3SAT to PLANAR-3SAT in $O(m^{2-\varepsilon})$

3 votes
1 answer
196 views

Natural (well studied) classes of graphs with treewidth $\Theta(n^\alpha)$ with $1/2 < \alpha < 1$

3 votes
0 answers
117 views

Decomposition of rectangular relations

3 votes
0 answers
126 views

Inverse of leftover hash lemma

2 votes
1 answer
92 views

Maximum cardinality disjoint cycle cover in undirected graphs

2 votes
0 answers
100 views

Graph recovery from pairwise-common neighborhoods

2 votes
0 answers
39 views

Heuristics for exact #3COLORING close to the 3-colorability threshold

1 vote
0 answers
113 views

Growth of random square lattice trees

1 vote
1 answer
392 views

Count satisfying assignments of CNF formulas over all possible negation assignments

0 votes
0 answers
96 views

Given $n\times n$ matrix $A$ with integer entries, find #$k$SAT formula that yields $\mathrm{perm}(A)>0$