We present new complexity results on the class of All constraints The central idea involves func tional elimination a general method of elimination whose focus is on the subclass of functional constraints One result is that for the subclass of All constraints strong n consistency and minimality is achievable in O en time where e n are the number of constraints and variables The main result is t...

In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time’s spending. Further, both of them can be used efficiently not only for positive (semi-) definite, but for any non-singular symmetric matrix inversion. We use simulation to verify results, ...