Knapsack problems for NL
type: Item
instance of: scholarly article
title: Knapsack problems for NL
zbMATH Open document ID: 1022.68559
DOI: 10.1016/0020-0190(95)00017-7
author: Birgit Jenner
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 985663
zbMATH Keywords: combinatorial problems
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: 0020-0190(95)00017-7
OpenAlex ID: W2071108434
cites work: Q3692867
cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
cites work: On a complexity hierarchy between L and NL
cites work: A taxonomy of problems with fast parallel algorithms
cites work: `` Strong '' NP-Completeness Results
cites work: Space-bounded reducibility among combinatorial problems
cites work: New problems complete for nondeterministic log space
cites work: The iterated mod problem
cites work: Symmetric space-bounded computation
cites work: Q4739657
cites work: On tape-bounded complexity classes and multihead finite automata
cites work: Q3707408
description: scientific article; zbMATH DE number 985663