25,161
edits
Changes
no edit summary
an American computer scientist and professor emeritus at [https://en.wikipedia.org/wiki/Indiana_University_Bloomington Indiana University Bloomington] <ref>[https://citations.cogs.indiana.edu/profile.php?faculty=pwp Paul Purdom: Cognitive Science Program: Indiana University Bloomington]</ref>.
His research interests include algorithms with fast average time for the [https://en.wikipedia.org/wiki/Conjunctive_normal_form conjunctive normal form (CNF)] [https://en.wikipedia.org/wiki/Satisfiability satisfiability problem], [[Backtracking|backtracking]], [[Search|game tree search]] along with probabilistic game models, [[Product Propagation|product propagation]] and [[Search Pathology|pathology]],
and [https://en.wikipedia.org/wiki/Computational_biology computational biology], especially in practical algorithms for [https://en.wikipedia.org/wiki/NP-completeness NP-complete ] computational biology problems.
=Selected Publications=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Purdom]]
