Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning $\omega $-Machines
- 1 October 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (5) , 779-807
- https://doi.org/10.1137/0216052
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Modalities for model checking: branching time logic strikes backScience of Computer Programming, 1987
- Storage requirements for fair schedulingInformation Processing Letters, 1983
- The classification of problems which have fast parallel algorithmsLecture Notes in Computer Science, 1983
- On restricted one-counter machinesTheory of Computing Systems, 1981
- AlternationJournal of the ACM, 1981
- Theory of ω-languagesI: Characterizations of ω-context-free languagesJournal of Computer and System Sciences, 1977
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972