3 citations · 11 across the 15 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016
Projective cofactor decompositions of Boolean functions and the satisfiability problem
Madhav Desai, Virendra Sule
Given a CNF formula , we present a new algorithm for deciding the satisfiability (SAT) of and computing all solutions of assignments. The algorithm is based on the concept o…
cs.CC2013★ 1 cited
Generalization of Boole-Shannon expansion, consistency of Boolean equations and elimination by orthonormal expansion
Virendra Sule
The well known Boole-Shannon expansion of Boolean functions in several variables (with co-efficients in a Boolean algebra ) is also known in more general form in terms of expans…