Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
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 ( [id://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
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://483553]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others browsing the Monastery: (4)
As of 2024-04-18 03:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found