Jeez, How much of this s**t do we have to endure? Is this group moderated, or what? OK, if not, can we GET a moderator to filter out this BS we're (presumably)...
OK, Problem solved, sort of. I'm using Thunderbird as my e-mail client, so I simply built a filter based on "sender = 'chani-k'" which sends all e-mails from...
Dear Mike and others interested in color theorems, the following "n_d_c" are at a level truth that is more than conjecture but less than a theorem they may be...
Hi all. First I'd like to apologize for my lack of moderation in the last month or so. The level of spam has become simply ridiculous, so I truly appreciate...
Hi all. This will be the last of the 'Special Notices' regarding membership rejections, but I just thought I'd inform the group that since turning on...
Dear Mike and others interested in color theorems, can any of our readers find whether any of these results are known to graph theory via methods other than...
Hi all. Just thought I'd let you know that I've already rejected 21 spammers from joining the site. I also updated the home page to include instructions for...
Thank you! ,////, Hi! .('._.')") (__3: )/ ("')_|_("') Ma. Lourdes Ty-Singzon "It is the time wasted for someone that makes that someone important." ... ...
Hi, I have cobbled together a Google Co-op search engine that focuses on pages related to theoretical CS : Search TCS <http://searchtcs.googlepages.com/> I am...
Hi Philip, ... Is there a way to see the current list of searched sites? It would be nice to be able to check this before suggesting new sites, since chances...
Hi all. Sorry for the last spam message. I checked the user who posted it and found he joined March 18th, 2007--about a month before we went to having...
Hi Kurt, ... I am afraid I couldn't find a way to do this : currently Google doesn't provide a way to list all these sites, as per one of the messages I found...
Hi Vishal, welcome to the group. I'm not sure if there are free electronic versions of the book. However, the table of contents is available on Amazon.com, so...
Hi Vishal, I recommend "Combinatorial Optimization, Algorithms and Complexity" of Christos Papadimitriou. It's an excelent book. Also, Introduction to ...
HI FRIENDS, I HAVE FOUND EBOOKS OF BELOW LISTED BOOKS... IF ANYBODY IS INTERESTED IN GETTING THEM, DON'T HESITATE IN DROPPING A MAIL.... VISHAL Hi Vishal, I...
Hi Vishal, Just wondering... Are these ebooks legal? Note that I _have_ seen many authors/publishers make unprintable PDF copies of their books available for...
... NP? ... Suppose for contradiction that DSPACE(n)=NP. Then every language L \in DSPACE(n^2) can be padded to yield a language L' \in DSPACE(n)=NP. But L'...
What may be ignored in big Oh notation? The average random case for string matching is the topic of the analysis. The relevant terms are n, m, A, logm: "n"...
Dear Daniel, By random string matching, do you mean that each character of the pattern and text string is picked uniformly at random and indepenedently from...
... Dear hatred, There is nothing unusual for a probability to be o(1) ;) However, your line of argument still has its merit. It is typical to set indicator...
... That is probably the key point. The m term may indeed be superlogarithmic ( examples are when searching for file fragments or fractions of well known...
Dear Ericpony, I derive the n/A^m this way: Pr[a match occurs] \leq \sum_{i} Pr[a match occurs at index i] (by the union bound) = \sum_{i} 1/A^m =n/A^m, You...
Dear Daniel, I did some google search and found this: ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/77/629/CS-TR-77- 629.pdf Maybe it helps? Best, ...
All known usages of matching strings may be a fairly long list... however the O( n/m ) method is very different in flavor from O( n+m ) regexp match. And being...
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.
