Andrew Miller wrote:
> 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 !=
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
> 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 alg
Hi all,
One issue which has recently been discussed amongst those of us working
on CellML tools is the best way to handle models which require systems
of equations to be solved efficiently. For example, if a model has
equations like:
f1(a, b, c) = 0
f2(a, b, c) = 0
f3(a, c) = 0
f4(b, c, d, e)
