Hard satisfiable formulas for DPLL-type algorithms

Details Hard satisfiable formulas for DPLL-type algorithms Hard satisfiable formulas for DPLL-type algorithms

2003-01-15

arxiv.org/abs/cs/0301012v1

Computer Science

Computational Complexity

9 pages

Scientific paper

We address lower bounds on the time complexity of algorithms solving the
propositional satisfiability problem. Namely, we consider two DPLL-type
algorithms, enhanced with the unit clause and pure literal heuristics.
Exponential lower bounds for solving satisfiability on provably satisfiable
formulas are proven.

Affiliated with

Also associated with

No associations

Rating

Hard satisfiable formulas for DPLL-type algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hard satisfiable formulas for DPLL-type algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hard satisfiable formulas for DPLL-type algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-497762