... Daniele is right: his nice counterexample shows that local ambiguities arising during Ion Petre's point array reconstruction algorithm do not imply ...
wow!! what a stunt. Ive been upstaged. VP is really going crazy here lately!! yet Im also all choked up. theory-edge prizes?? maybe we've finally hit the...
hi all. this is a sorry story we saw a little while ago. the US govt wants to start to restrict research funds in the country so that foreign students cannot...
On Thursday, Jan 2, 2003, at 22:06 US/Eastern, vznuri@... ... Government, together with corporations, have been trying to suppress research into...
David Richards
drichards@...
Jan 3, 2003 2:40 pm
6618
Does your dealer charge you regular street prices? LOL Are you refering to the town board, the mayor, the PTA, or what when you say "they" are taking control?...
hi all. fyi, this is a nice, lengthy paper turned up by GS a little while ago, very recent, 2002. I was advocating empirical approaches on the graphnet mailing...
the gnu math library is also extremely good. I wonder how these two compare. naylor is the author of an interesting hard instance generator on dimacs. ... ...
Ok, here's the puzzle as it appeared on http://thue.stanford.edu/puzzle.html at 21.00 GMT today. String-cutting Problem. Given positive integers k and d1 < d2...
Further clarification: each of the k-1 cuts can be applied to any of the pieces of string obtained thus far (as distinct from cutting pieces off the end of the...
The problem can be solved by a dynamic programming approach. Let f(m) denote the maximum number of pieces that can be obtained (with the given restrictions) if...
Okay, here's my variation. This is a simple dynamic programming approach that calculates v1, v2, ..., vn in turn, where vi is the maximum number of pieces...
Oops, you are right, my algorithm, as described in the previous post is only pseudopolynomial. Clearly, it is sufficient to compute f(m) only for the values...
... I'll second that. (I switched out of Digest mode to track this.) I think everyone seems in agreement that cycling through all values up to dn will take...
... Hi Mark, don't you have to add 1 to v[i]: v[i]:=v[j1]+v[j2] +1 so as to take into account the full string and perhaps you have to adjust the condition too....
... Let c[i] = v[i] - 1 = # of cuts that can be made. (Remember v[i] = # of strings in the end.) Then I agree that c[i] := c[j1] + c[j2] + 1, but when I ...
I implemented the algorithm and it works. Congratulations,Mark. Here is the code in case somebody would like to follow the ... #include <stdio.h> #define...
hi all. I am not following this too closely but its lots of fun. nothing like a little prize money to get the blood rolling. Ive never seen such a reaction...
... Actually this is what one might call associative dynamic programming, which capitalizes on the associativity of addition (likewise concatenation,...
... Sorry, we were heading off to a restaurant and I sent that off in a bit of a rush. What I meant to say was, this was at challenge level 1 (for a suitable...
Hi, ... in this case it could be usefull, that there will exist hard crypto keys which private part are owned by the government. And all streams from the...
maruk
maruk64@...
Jan 4, 2003 5:20 pm
6636
Russian scientist Serguei Kara-Murza about modern socio-economic situation in Russia, and its historical and kulture roots: http://skaramurza.chat.ru in...
Anatoly D. Plotnikov
aplot@...
Jan 4, 2003 5:38 pm
6637
As promised I've allowed Digest readers time to protest the consensus that was already evident within less than an hour of posting the problem at ...
After consulting with Vaughan, I'm going to put my prize money up as the prize in another contest. I will post the problem to theory-edge at 21.00 GMT (which...
Your problems are piffling wimpy wastes of time...just wait till I put up my problem and the Prize Money attendant! You guys will be flummoxed, consternated...
Warren writes: Well bring it on! Forget about the prize money. It better be good or I won't touch it. It must be achievable and not ludicrous in nature. The...
Ok, but you all had better be prepared for the worst! Get your pencils sharpened as they say! Regards, Wayne ... Warren writes:Well bring it on! Forget about...
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.
