Neural and Belief Networks


Steepest Descent Can Take Exponential Time for Symmetric Connection Networks
Amin Haken, Michael Luby
Complex Systems, Vol. 2, 1988, pp. 191-196.

An Optimal Approximation Algorithm for Bayesian Inference (601K)
Paul Dagum, Michael Luby
Artificial Intelligence, Vol. 60, 1993, pp. 141-153.

The Computational Complexity of the Stable Configuration Problem for Connectionist Models
Gail Godbeer, John Lipscomb, Michael Luby
Technical Report 208/88, Computer Science Department, University of Toronto, 1988.

On the Parallel Complexity of Symmetric Connection Networks
Michael Luby
Technical Report 214/88 Computer Science Department, University of Toronto, 1988.