The final results are up. You can also see your individual scores for each matrix on what was the submission page. I'll add some more analysis and results...
Excellent contest! JCM, you must tell all. Lars, it would be cool if when you list the ratio, if we have the top entry, also list the ratio we are beating the...
Thank you for this excellent contest, and very good competitors (especially Ivan/Vadim and the -always- excellent Tomas). It was much harder than expected, and...
First of all, Lars, thank you very much for this very challenging contest and congratulations on the well chosen problems! I believe that in Part B our score...
In einer eMail vom 04.04.2005 07:50:11 Westeuropäische Sommerzeit schreibt euler@...: E[n] = 2*((n+1)/4)^((n-1)/2) / (n^2*(n-1)) which works as follows: ...
Well, it's our ratios for Lars' contest. The E(n) formula works for 4k+3, and I empirically added the 4,2,9 factors because they matched for the contest. ...
In einer eMail vom 04.04.2005 10:35:57 Westeuropäische Sommerzeit schreibt ... OK, let's see what the experts say, Orrick,Helms,.. I hope they'll post here ...
http://www.worlddesigncenter.com/contest/highest.php Those are the maximal determinants out of the matrices submitted for part A. The ties go to the earliest...
For the next contest, you are to write a fully functional, large-scale application. By submitting, you will give me rights to your submission. :) I have to say...
I have to admit this is the first time I've ever used both the Fast Fourier Transform and the Chinese Remainder Theorem in the same program! Let's hear how...
My score is bad (around 25) but just in case you can find something interesting I have attached my program(s). Now I wish I'd put more energy into it... ...
I must admit that my program to reach 25 points in A was much less sophisticated than rg's: 1. Start with a random 0-1-matrix. Just out of curiosity I made the...
... I'm surprised that you get 25 with this. When I just change a random entry and keep it iff the score increases, then I get about 16. Why do you think...
... For part A, we used only double, which has sufficient precision, since I didn't use any accuracy on part A ! ... No, to my knowledge (I searched a lot of...
I understand it is possible to beat O(n^3) using a strassen style algorithm but I havent seen an implementation and I dont think it gives you much benifit with...
I understand it is possible to beat O(n^3) using a strassen style algorithm but I havent seen an implementation and I dont think it gives you much benifit with...
I got up to about 27 using simulated annealing and few optimisation tricks to speed up the calculation of the determinants. My best results were based on...
I started playing with some determinants in Excel. With the solver, I was able to find optimal solutions for part A for 10-12. It appeared to me that an...
beylevem
beylevem@...
Apr 4, 2005 10:38 pm
86
... construct ... Wow, check out this paper: http://www.math.tau.ac.il/~nogaa/PDFS/av1.pdf If I understand their construction, this would generate absolutely ...
There's lots I want to say, but for now I wanted to congratulate all the top finishers for their excellent work and for the new records they have established. ...
... I used Ubasic with arbitrary precision (rational numbers) 300 ' ---------det A(n,n)--------------------- 304 DET=1:for L=1 to N:for K=L+1 to N:if...
... My 33 has the same score as your 33 for part A. Someone else has a higher score for the 33; it would be nice to know who it is. I think the number two...
... so I assume this is the most important trick in this contest (?) ... yes, effort ;-) And persistence. I mean, not just one killer-idea but lots of small...
Oops; I lied. My high determinant for 38 was *not* of the form of a pair of recirculating matrices; it was a *single* recirculating matrix. Sorry for the...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
