Paul W. Purdom

From Chessprogramming wiki
Revision as of 21:28, 4 April 2021 by GerdIsenberg (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * People * Paul W. Purdom

Paul W. Purdom [1]

Paul W. Purdom, Jr.,
an American computer scientist and professor emeritus at Indiana University Bloomington [2]. His research interests include algorithms with fast average time for the conjunctive normal form (CNF) satisfiability problem, backtracking, game tree search along with probabilistic game models, product propagation and pathology, and computational biology, especially in practical algorithms for NP-complete computational biology problems.

Selected Publications

[3]

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

External Links

References

Up one level