User delete000

12 votes

1 answer

329 views

Fast classical simulation of quantum algorithms

asked Sep 10, 2018 at 14:46

8 votes

1 answer

311 views

How to benchmark #2-SAT counting algorithms?

asked Oct 6, 2017 at 18:21

6 votes

0 answers

133 views

Counting on grid graphs

asked Aug 7, 2020 at 21:40

5 votes

1 answer

230 views

Hashing-based vs almost uniform sampling-based approximate counting

asked Dec 23, 2021 at 16:17

5 votes

2 answers

328 views

Efficient way to generate random planar cubic bipartite graphs

asked Jan 28, 2018 at 15:41

5 votes

0 answers

92 views

Complexity of bounded degree full contraction

asked Mar 15, 2018 at 23:38

4 votes

0 answers

156 views

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

asked Feb 4, 2018 at 1:20

3 votes

1 answer

199 views

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

asked Feb 6, 2018 at 19:39

3 votes

0 answers

117 views

Decomposition of rectangular relations

asked May 9, 2018 at 22:01

3 votes

0 answers

143 views

Inverse of leftover hash lemma

asked Apr 21, 2023 at 22:11

2 votes

1 answer

123 views

Maximum cardinality disjoint cycle cover in undirected graphs

asked Dec 29, 2023 at 19:17

2 votes

0 answers

105 views

Graph recovery from pairwise-common neighborhoods

asked Mar 24, 2021 at 23:37

2 votes

0 answers

81 views

Interesting counting problems with polynomially many solutions

asked 2 days ago

2 votes

0 answers

42 views

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

asked Oct 3, 2018 at 15:24

1 vote

0 answers

115 views

Growth of random square lattice trees

asked Aug 31, 2018 at 20:54

1 vote

1 answer

402 views

Count satisfying assignments of CNF formulas over all possible negation assignments

asked Jun 7, 2019 at 21:47

0 votes

0 answers

22 views

Natural reduction from partially observable Markov decision process planning to reconfiguration

asked May 16 at 12:45

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$

asked May 13, 2019 at 21:20

Stack Exchange Network

18 Questions

Fast classical simulation of quantum algorithms

How to benchmark #2-SAT counting algorithms?

Counting on grid graphs

Hashing-based vs almost uniform sampling-based approximate counting

Efficient way to generate random planar cubic bipartite graphs

Complexity of bounded degree full contraction

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

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

Decomposition of rectangular relations

Inverse of leftover hash lemma

Maximum cardinality disjoint cycle cover in undirected graphs

Graph recovery from pairwise-common neighborhoods

Interesting counting problems with polynomially many solutions

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

Growth of random square lattice trees

Count satisfying assignments of CNF formulas over all possible negation assignments

Natural reduction from partially observable Markov decision process planning to reconfiguration

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