Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines
- 1 January 1986
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 306-320
- https://doi.org/10.1007/3-540-16078-7_85
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- A technique for proving liveness of communicating finite state machines with examplesPublished by Association for Computing Machinery (ACM) ,1984
- Storage requirements for fair schedulingInformation Processing Letters, 1983
- 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
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Decision problems forω-automataTheory of Computing Systems, 1969