[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: RFA: invert-speedup-1.diff

From: Alexandre Duret-Lutz
Subject: Re: RFA: invert-speedup-1.diff
Date: Sun, 30 Mar 2003 03:53:26 +0200
User-agent: Gnus/5.090016 (Oort Gnus v0.16) Emacs/21.2 (gnu/linux)

>>> "Raja" == Raja R Harinath <address@hidden> writes:


 Raja> I thought of them too.  However, when you convert them back to SOP
 Raja> form to describe to the user, they sometimes may seem more verbose
 Raja> than necessary.  

Isn't Minato-Morreale's algorithm the answer?  (No idea how this
works, the paper [*] is amongst the pile of things I want to read when
I get some spare time.)

 Raja> Also, the size of a ROBDD is related to the ordering of
 Raja> variables, though for normal usage, there shouldn't be a
 Raja> major problem.

In practice I think users often layout their nested if/then/else
blocks in a way that minimize duplications.  So, since BDDs are
also about encoding if/then/else, ordering conditionals the way
they are encountered in seems attractive.

Anyway, as long as the present implementation works fine, it's
probably overkill to think of something else.

Alexandre Duret-Lutz

reply via email to

[Prev in Thread] Current Thread [Next in Thread]