Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Re^2: Better algorithm than brute-force stack for combinatorial problems? (Benchmarks)

by BrowserUk (Patriarch)
on May 21, 2004 at 23:07 UTC ( [id://355492]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Better algorithm than brute-force stack for combinatorial problems? (Benchmarks)
in thread Better algorithm than brute-force stack for combinatorial problems?

And that's the value of benchmarks :)


Examine what is said, not who speaks.
"Efficiency is intelligent laziness." -David Dunham
"Think for yourself!" - Abigail
  • Comment on Re: Re^2: Better algorithm than brute-force stack for combinatorial problems? (Benchmarks)

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others sharing their wisdom with the Monastery: (8)
As of 2024-05-28 07:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found