The matrix An is symetric, and his determin sometimes is 0.
I'm practising and solving this problem with the aditiv algorithm of Balas, and his results about the complexity of time don+t satisfy me. This problem for n=32=2**5 was executed in 6 hours aproximately in one Pentium 100 Mhz. I'm interesting to solve the maximum number of variables about this problem.
All suggestions or recomendations about this problem, or bibliography to see will be gratefully.
Regards. I hope your mail or news.
Miguel Angel Cbmara Facultad de Cc. Matembticas Universidad Complutense de Madrid Spain