82 citations · 214 across the 25 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
Knowledge Compilation for Boolean Functional Synthesis
S. Akshay, Jatin Arora, Supratik Chakraborty +3
Given a Boolean formula F(X,Y), where X is a vector of outputs and Y is a vector of inputs, the Boolean functional synthesis problem requires us to compute a Skolem function vector…
cs.DS2019
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…