Louis E. Rosier, Hsu-Chun Yen. Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines. In Burkhard Monien, Guy Vidal-Naquet, editors, STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings. Volume 210 of Lecture Notes in Computer Science, pages 306-320, Springer, 1986.
@inproceedings{RosierY86:1,
title = {Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines},
author = {Louis E. Rosier and Hsu-Chun Yen},
year = {1986},
tags = {e-science},
researchr = {https://researchr.org/publication/RosierY86%3A1},
cites = {0},
citedby = {0},
pages = {306-320},
booktitle = {STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings},
editor = {Burkhard Monien and Guy Vidal-Naquet},
volume = {210},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-16078-7},
}