Subset sum problem: probabilistic fast testing algorithm...
An algorithm that determines if any subset sum is to 0 modulo a large
constant K (preferably a prime number) may be a good probabilistic
fast testing algorithm for the subset sum problem...
.
Relevant Pages
- Re: Is there any COBOL program for verify the SSN?
... Modulus 11 is NOT the same as Modulo 11. ... The Luhn algorithm or Luhn formula, also known as the "modulus 10" or "mod 10" algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers and Canadian Social Insurance Numbers. ...
(comp.lang.cobol) - RE: [PHP] Looking for help with a complex algorithm
... it is a special case of the knapsack problem - the "subset sum" problem. ... You'll need to be aware that it's of exponential complexity. ... identifying the right problem here leads to a solution (the algorithm). ...
(php.general) - Re: Testing RAM
... Is there something that the test does on that particular motherboard AND memory stick combo? ... If I use two sticks in any combination of the three available slots, then errors will arise during the MemTest86+ Modulo 20 algorithm. ...
(microsoft.public.windowsxp.hardware) - 8-bit CRC
... I have the spec ETSI TS 101 369 which describes the CRC ... divided (modulo 2) by the generator polynomial ... What I really want is the C code that implements the algorithm. ...
(comp.arch.embedded) - Re: inverse modulos
... use of the extended Euclidean algorithm, but it's not giving the result ... The inverse of a modulo m is unique *modulo m*, ... congruent modulo 5 (i.e. they differ from each other by a multiple ...
(sci.math) |
|
