Prev: Lauching application from an icon
Next: can't get ListVectorPlot3D to work.
From: Eirik Larsen Følstad on 11 Jun 2010 07:57
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






 | 
Pages: 1
Prev: Lauching application from an icon
Next: can't get ListVectorPlot3D to work.