- From: r.britten at auckland.ac.nz (Randall Britten)
- Subject: [cellml-discussion] Identifying smaller subsystems of simultaneous equations in differential-algebraic models
- Date: Tue, 22 Apr 2008 15:31:51 +1200
>
However, in general, I haven't been able to find an efficient
>
(polynomial time) algorithm to compute this break-down (but I also
>
haven't yet proved that the problem is NP-complete, so there may be a
>
polynomial time solution even if P != NP).
>
Hi Andrew
If possible, please outline the algorithm that you have found, even though
it is not efficient.
Regards,
Randall
Archive powered by MHonArc 2.6.18.