Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^7: Algorithm for cancelling common factors between two lists of multiplicands (192.5 ms)

by tmoertel (Chaplain)
on Aug 13, 2005 at 14:29 UTC ( #483553=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    [thor@redwood fishers-exact-test]$ cat fetbig.dat
    100000 200000
    ...
    real    21m8.445s
    user    20m56.788s
    sys     0m6.831s
    
  2. or download this
                   |
     1.32499459649680040e-14760
    +1.324994596496999433060120009448386330459655228210366819887079e-14760
                   |
    

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://483553]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (4)
As of 2020-02-21 12:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What numbers are you going to focus on primarily in 2020?










    Results (95 votes). Check out past polls.

    Notices?