Solving a system of linear equations has a complexity of at most O (n). At least n operations are needed to solve a general system of n linear equations. The best algorithm known to date was developed by Don Coppersmith and Shmuel Winograd and dates from 1990. It has a complexity of n Unfortunately, it is of little practical use.