> Test Process:
>
> In this test, I use five testcases.
> case1 and case2 are the default cases we gave to them.
> case3 is a simple case that stands for the xor function.
> case4 is more complicate case (8 inputs ,4 outputs).
> case5 is most complicate case (41inputs ,35 outputs).
>
> Then I begin to test their program.
> I tested their programs at Sun blade 1000, 2G memory.
>         at PIII-750 with 256 M memory
>
> I use five indexs to evalute the program.
> 1. Correctness ==> check the result is correct or not.
>                                  we use one verification program to test.
> 2. Prime implicants ==>  the less means the result is better.
> 3. Speed   ==> total cpu time.  (only in workstation).
> 4. Memory ==> the sbrk position (only in workstation).
> 5. Misc      ==> About the UI. Program architecture....
>
> After all, I put all test results into on excel file to ease the
comparision.
> You can see this excel file in the attachment.
>
> Algorithm:
>
>     A16,A17,A18 use exact method to
>     A19  use BDD + sparse matrix
>     A21  use ROBDD.
>     A23  use exact method.
>     A24  based on espresso (heuristic)
>
> Test Results:
>
>       Only A19 and A21 passed the case4. All hanged in case5.
>       A19 always get the better outputs. (The less prime implicants).
>       But A19 use more CPU time and memory size.
>       The detail can be seen in the excel file.
>
>                 Ranking:
>       A19 -> A21 -> A18->A16-> A17->A23->A24.