On a complexity hierarchy between L and NL

DOI10.1016/0020-0190(88)90057-9MaRDI QIDQ1114402zbMATH OpenOpenAlexFDO

Authors Sang Cho, Dung T. Huynh

Publication date 1988

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(88)90057-9

zbMATH Keywords

complexity class of languagesone-way nondeterministic counter machineunary knapsack

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Knapsack problems for NL
• scientific article; zbMATH DE number 512811
• Space hierarchy theorem revised.
• scientific article; zbMATH DE number 1848283
• On the Structure of Logspace Probabilistic Complexity Classes

Cites work

• A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
• A taxonomy of problems with fast parallel algorithms
• Finite-Turn Pushdown Automata
• Relationships between nondeterministic and deterministic tape complexities

Cited in

(8)

• A note on the space complexity of some decision problems for finite automata
• On the universe, disjointness, and containment problems for simple machines
• On the complexity of the Leibniz hierarchy
• scientific article; zbMATH DE number 4041256 (Why is no real title available?)
• On languages accepted with simultaneous complexity bounds and their ranking problem
• On the computational complexity of problems related to distinguishability sets
• On partially blind multihead finite automata.
• Knapsack problems for NL

This page was built for publication: On a complexity hierarchy between L and NL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114402)