Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version)

Piotr Berman, Janos Simon. Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version). In 24th Annual Symposium on Foundations of Computer Science, 7-9 November 1983, Tucson, Arizona, USA. pages 304-311, IEEE, 1983.

Authors

Piotr Berman

This author has not been identified. Look up 'Piotr Berman' in Google

Janos Simon

This author has not been identified. Look up 'Janos Simon' in Google