in [Programming]

Four (Double-Meaning) Lines May Have Solved a Problem ###As far as some queries didnt return OK, result is NO where_string_size=1048539 # constant string size in where ###We are trying (example with N=5): ###select a from crash_me where b >='11111' ... 29 Mar 2010 06:56
Question about PCP[O(logn), polylogn]=NP Hi all, I am reading Madhu Sudan's lecture notes about PCP theorem, consisting of four lectures, available at http://people.csail.mit.edu/madhu/pcp/course.html There is a place I just do not understand in the second lecture, about the proof of PCP[O(logn), polylogn]=NP. The proof employs the low- degree testi... 29 Mar 2010 05:50
Divisor Products: 1,2,3,8,5,36,7,64,27,100,11,1728,13,196,225,1024,17,5832,19,8000,441,484, 23,331776,125,676,729,21952,29,810000,31,32768,1089,1156,1225,100776 96,37,1444,1521,2560000,41,... ( Pd(n) is the product of all positive divisors of n.) ... 29 Mar 2010 23:37
The Numbers Surrounding Unsolved Problems May Be Simple and Elegant 1 141 1 1 1 8 1 1 8 40 8 1 1 8 1 1 1 1 12 1 1 12 108 12 1 1 12 108 540 108 12 1 1 12 108 12 1 1 12 1 1 1 1 16 1 1 16 208 16 1 1 16 208 1872 208 16 1 1 16 208 1872 9360 1872 208 16 1 1 16 208 1872 208 16 1 1 16 208 16 1 1 16 1 1 ... 28 Mar 2010 20:05
Optimal Stopping Related to the Random Walk In Section 3, this problem is generalized to tbe one where the gambler does not persist in the very largest, but rather feels satisfaction provided that his fortune upon stopping is within $m$ units from the largest. More specifically, when the allowance measure is $m$ $($ $m$ is a given positive integer), the ga... 28 Mar 2010 01:26
#JVXL VERSION 1.4 #JVXL VERSION 1.4 #created by Jmol Version 11.5.36 2008-04-29 08:46 on Sun Jul 12 07:23:05 BST 2009 MO range (-4.310481, -6.746769, -4.149228) to (4.310481, 6.746769, 5.056894) calculation type: 6-311G(d) (5D, 7F) -24 -4.310481 -6.746769 -4.149228 ANGSTROMS 80 0.107762024 0.0 0.0 80 0.0 0.16866922 0.0 80 0.0 ... 27 Mar 2010 23:16
Call for papers (Deadline Extended): TMFCS-10, USA, July 2010 It would be highly appreciated if you could share this announcement with your colleagues, students and individuals whose research is in theoretical computing, complexity theory, algorithms, computational science and related areas. Call for papers (Deadline Extended): TMFCS-10, USA, July 2010 The 2010 Internati... 27 Mar 2010 10:50
M's Lemma: For all primes p let 6=283 (ap)2 = p 283 + Np(f) if 1; for all primes p 6=283: ... 27 Mar 2010 09:35
The River Jordan Floods Numbers, the leaders are 6 and 283. Np(f) for f = xn ô x ô 1, n = 2; 3; 4; 5: p n = 2 n = 3 n = 4 n = 5 2 0 0 0 0 3 0 0 0 0 5 1 1 0 0 7 0 1 1 0 11 2 1 1 0 13 0 0 1 0 17 0 1 2 2 19 2 1 0 1 23 0 2 1 1 59 2 3 1 0 83 0 1 4 0 5.2. The case n = 2. The discriminant of f = x2 ô x... 27 Mar 2010 09:35
Optimal Golomb Ruler to SAT Hi, in addition to my factorization program I released a second converter : http://www.tokis-edv-service.de/index.php/beispiele/optimal-golomb-ruler-to-sat The precondition is that you are familiar with the OGR problem. Best Regards Thorsten ... 25 Mar 2010 10:16 |