Cynthia A. Brown

The Pure Literal Rule and Polynomial Average Time

For a simple parameterized model of conjunctive normal form predicates, we show that a simplified version of the Davis–Putnam procedure can, for many values of the parameters, solve the satisfiability problem in polynomial average time. Let v be the number of variables,

Polynomial-average-time satisfiability problems

t(v)

Backtracking with multi-level dynamic search rearrangement

the number of clauses in a predicate, and

A new base change algorithm for permutation groups

p(v)

An Analysis of Backtracking with Search Rearrangement

the probability that a given literal appears in a clause (

Parsing extended LR(k) grammars

p(v)

Semantic routines and LR(k) parsers

is the same for all literals). Let

Comments on "A Counterexample to a Diameter Algorithm for Convex Polygons

\varepsilon

Instructional frameworks: toolkits and abstractions in introductory computer science

be any small positive constant and n any large positive integer. Then a version of the Davis–Putnam procedure that uses only backtracking and the pure literal rule uses average time that is polynomial in the problem size when any of the following conditions are true for large v. (1)

Using Visual Feedback and Model Programs in Introductory Computer Science

t(v) \leqq n\ln v