Profile Activity

delete000

Meta user

Network profile

Reputation

372

2016
2017
2018
2019

Top tag

graph-theory

Next privilege

500 Rep.

Access review queues

Badges

Newest

Suffrage

Next badge

112/300

Impact

0 posts edited

0 helpful flags

112 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

11 Questions

Views Newest Activity Votes

votes

answer

219

views

Fast classical simulation of quantum algorithms

Sep 12 '18 at 9:49 Frédéric Grosshans 678

votes

answer

191

views

How to benchmark #2-SAT counting algorithms?

reference-request sat counting-complexity random-k-sat

Oct 9 '17 at 16:02 smengel 126

votes

answers

views

Complexity of bounded degree full contraction

cc.complexity-theory graph-theory graph-algorithms np-hardness graph-minor

Mar 23 '18 at 22:35 delete000 372

votes

answers

238

views

Efficient way to generate random planar cubic bipartite graphs

cc.complexity-theory graph-theory graph-algorithms planar-graphs bipartite-graphs

Feb 2 '18 at 15:43 delete000 372

votes

answers

124

views

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

cc.complexity-theory graph-theory reductions polynomial-time boolean-formulas

Feb 4 '18 at 17:47 delete000 372

votes

answers

112

views

Decomposition of rectangular relations

lo.logic boolean-functions relational-structures

May 9 '18 at 22:01 delete000 372

votes

answer

171

views

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

graph-theory treewidth

Feb 8 '18 at 5:20 Sariel Har-Peled 8,303

votes

answers

views

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

counting-complexity graph-colouring

Oct 3 '18 at 15:24 delete000 372

vote

answer

117

views

Count satisfying assignments of CNF formulas over all possible negation assignments

cc.complexity-theory approximation-algorithms sat counting-complexity

Jun 17 at 13:46 Emil Jeřábek 10.8k

vote

answers

101

views

Growth of random square lattice trees

co.combinatorics tree statistical-physics asymptotics

Sep 1 '18 at 22:49 delete000 372

votes

answers

views

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

sat counting-complexity reductions permanent

May 13 at 21:20 delete000 372

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

11 Questions

Fast classical simulation of quantum algorithms

How to benchmark #2-SAT counting algorithms?

Complexity of bounded degree full contraction

Efficient way to generate random planar cubic bipartite graphs

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

Decomposition of rectangular relations

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

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

Count satisfying assignments of CNF formulas over all possible negation assignments

Growth of random square lattice trees

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