5 citations · 13 across the 12 of their papers we have counts for
1 paper · 1 filter
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…