138 citations · 778 across the 69 of their papers we have counts for
5 papers · 1 filter
FPRAS Approximation of the Matrix Permanent in Practice
James E. Newman, Moshe Y. Vardi
The matrix permanent belongs to the complexity class #P-Complete. It is generally believed to be computationally infeasible for large problem sizes, and significant research has be…
Parallel Weighted Model Counting with Tensor Networks
Jeffrey M. Dudek, Moshe Y. Vardi
A promising new algebraic approach to weighted model counting makes use of tensor networks, following a reduction from weighted model counting to tensor-network contraction. Prior…
On Symbolic Approaches for Computing the Matrix Permanent
Supratik Chakraborty, Aditya A. Shrotri, Moshe Y. Vardi
Counting the number of perfect matchings in bipartite graphs, or equivalently computing the permanent of 0-1 matrices, is an important combinatorial problem that has been extensive…
Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions
Jeffrey M. Dudek, Leonardo Dueñas-Osorio, Moshe Y. Vardi
Constrained counting is a fundamental problem in artificial intelligence. A promising new algebraic approach to constrained counting makes use of tensor networks, following a reduc…
Principled Network Reliability Approximation: A Counting-Based Approach
R. Paredes, L. Duenas-Osorio, K. S. Meel +1
As engineered systems expand, become more interdependent, and operate in real-time, reliability assessment is indispensable to support investment and decision making. However, netw…