ajseidl
October 10th, 2006, 07:36 PM
Ok guys, here's the issue. I'm working with the Karp-Rabin algorthim for searching through text, and I'm a bit lost. You can get the paper at http://www.research.ibm.com/journal/rd/312/ibmrd3102P.pdf .
In thier original description, K & R use an alphabet of binary digits. What I'm interested in is how many primes have to be selected for a different alphabet. Say, one with 4 characters, or one with 12. How do I determine that?
Thanks in advance.
Adam Seidl
In thier original description, K & R use an alphabet of binary digits. What I'm interested in is how many primes have to be selected for a different alphabet. Say, one with 4 characters, or one with 12. How do I determine that?
Thanks in advance.
Adam Seidl