Home Page of Paul W. Purdom, Jr.
I am a Professor of
Computer Science and an Associate of the
Cognitive Science Program at
This page features links allowing you to
access other information about myself, as well as some general info.
My main interest is algorithms with fast average time for the
conjunctive normal form (CNF) satisfiability problem and for other
constraint satisfaction problems. I am also interested
in computational biology, especially in practical algorithms
for NP-complete computational biology problems.
||"The Analysis of Algorithms",
Paul Walton Purdom, Jr., and
Cynthia A. Brown
- Summing Series
- Products and Binomials
- Asymptotic Approximation
- Simple Linear Recurrences
- General Linear Recurrences
- Full-History and Nonlinear Recurrences
- Multidimensional Recurrences
- Global Techniques
- Lower Bounds and NP Completeness
- CNF Generator for Factoring Problems
Recent Technical Reports
Backtracking and Probing, 1993.
Average Time for the Full Pure Literal Rule, 1992.
My Ph. D. Students
Former Students, Ph. D. Graduates
Dmitri A. Gusev and
(Ajou University, Korea),
Richard Mong, Khaled Bugrara,
(Computer Science Department,
Ball State University),
Harry C. Heacox
current semester course schedule
for my teaching schedule.
General information sources
Information on HTML and WWW
My e-mail address is