An exact algorithm for the Boolean connectivity problem for k-CNF

From MaRDI portal
(Redirected from An exact algorithm for the Boolean connectivity problem for k-CNF)
An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (scientific article; zbMATH DE number 5793454)















This page was built for publication: An exact algorithm for the Boolean connectivity problem for \(k\)-CNF

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930587)