5 citations · 5 across the 4 of their papers we have counts for
1 paper · 1 filter
Paweł M. Idziak, Jacek Krzaczkowski
Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial tim…