Hi Eric,

e_lehman@... wrote:
> I did a pretty close study of satisfiability algorithms last fall, so
> I'm reasonably up on that topic. I think I have a simple algorithm
> for 3-SAT that probably beats the best known, but the analysis looks
> hairy. There is some question whether improving the run time from
> 1.334^n to 1.295^n (or whatever) is really interesting anyway.

From a theoretical point of view, I agree.

In another way, the algorithms are often tested on benchmarks,
randomly generated or coming from real world problem (planning,
model checking, etc.)
You can find such benchmarks at:
http://www.satlib.org/

Then you can compare your results to existing algorithms:
http://www.lri.fr/~simon/satex/satex.php3

And you may subscribe to SAT Live! if the satisfiability
problem interests you ;-=)
http://www.satlive.org/

I am looking forward reading your work on the subject,

Daniel

--
Daniel Le Berre http://cafe.newcastle.edu.au/daniel/
Research Associate, mailto:daniel@...
School Of Management, S123, University of Newcastle, NSW 2308
Australia Tel: (02) 4921 {5009(Off), 7055(Lab.), 6911(Fax)}