LogicalExpand and BooleanConvert
- To: mathgroup at smc.vnet.net
- Subject: [mg110278] LogicalExpand and BooleanConvert
- From: Eirik Larsen Følstad <eirik.folstad at q2s.ntnu.no>
- Date: Fri, 11 Jun 2010 07:57:39 -0400 (EDT)
Hi, Is is possible to get some information of the algorithm that is used for converting a boolean function to the disjunctive normal form (Sum of Products) using LogicalExpand and BooleanConvert? The reason for this question is that getting the minimal disjunctive normal form is NP-hard. What is the "stopping" conditions for the LogicalExpand and BooleanConvert? Vennlig hilsen / Best regards, Eirik Larsen F=F8lstad