Computational complexity studies the intrinsic difficulty of mathematically posed problems and seeks optimal means for their solutions. This is a rich and diverse field; for the purpose of this paper we present a greatly simplified picture. Computational complexity may be divided into two branches, discrete and continuous.
No takes yet. Share an insight, caveat, or question.
A 1989 study studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: