5 citations · 13 across the 12 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2023★ 5 cited
Picturing Counting Reductions with the ZH-Calculus
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
Counting the solutions to Boolean formulae defines the problem #SAT, which is complete for the complexity class #P. We use the ZH-calculus, a universal and complete graphical langu…
cs.CC2022
A Graphical #SAT Algorithm for Formulae with Small Clause Density
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
We study the counting version of the Boolean satisfiability problem #SAT using the ZH-calculus, a graphical language originally introduced to reason about quantum circuits. Using t…