Re: [cellml-discussion] Identifying smaller subsystems of simultaneous equations in differential-algebraic models

2008-04-21 Thread Randall Britten
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

Re: [cellml-discussion] Identifying smaller subsystems of simultaneous equations in differential-algebraic models

2008-04-21 Thread Andrew Miller
Randall Britten wrote: 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,