NP-complete and harder algorithms
From: Cyce (cyce_at_amtelecom.net)
Date: 11/19/04
- Next message: alistair: "dark energy,acceleration and redshift"
- Previous message: Sensei: "FEM with C/C++"
- Messages sorted by: [ date ] [ thread ]
Date: Fri, 19 Nov 2004 19:30:25 +0000 (UTC)
I'm curious on any applications for an algorithmic solution i've developed.
It will solve the np algorithm i'm working with (monkey puzzle) in a best
case of under a second and a worst case of about a month. (running on a
pentium-3 1Ghz laptop)
The problem contains 4x25! possible combinations with the time to compute
all possible combinations varying in accordance with the input variables.
(1second to 1month)
I read somewhere that there are approximation algorithms and am curious how
long they take to process?
I haven't checked out all of the NP or NPC algorithms but am interested in
whether or not it would be worth my time to code polynomial solutions for
any of them...
If anyone has any questions or knows of a use for a NP or NPC algorithmic
solution please contact me at:
cyce@amtelecom.net
- Next message: alistair: "dark energy,acceleration and redshift"
- Previous message: Sensei: "FEM with C/C++"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
|