Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

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

by BrowserUk (Patriarch)
on Aug 14, 2005 at 04:31 UTC ( #483658=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    #! perl -slw
use strict;
...

print Scientific FET::pCutoff [ 5, 0], [1, 4];
#print Scientific FET::pCutoff [ 989, 9400 ], [ 43300, 2400];

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://483658]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (6)
As of 2023-09-27 08:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found
    Notices?