251 citations · 540 across the 15 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2020★ 17 cited
Tensor Network Rewriting Strategies for Satisfiability and Counting
Niel de Beaudrap, Aleks Kissinger, Konstantinos Meichanetzidis
We provide a graphical treatment of SAT and #SAT on equal footing. Instances of #SAT can be represented as tensor networks in a standard way. These tensor networks are interpreted…
cs.CC2014★ 8 cited
On computation with 'probabilities' modulo k
Niel de Beaudrap
We propose a framework to study models of computation of indeterministic data, represented by abstract "distributions". In these distributions, probabilities are replaced by "ampli…
cs.CC2012★ 4 cited
On the complexity of solving linear congruences and computing nullspaces modulo a constant
Niel de Beaudrap
We consider the problems of determining the feasibility of a linear congruence, producing a solution to a linear congruence, and finding a spanning set for the nullspace of an inte…