Knapsack problems for NL
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3917710 (Why is no real title available?)
- scientific article; zbMATH DE number 3936519 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A taxonomy of problems with fast parallel algorithms
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- New problems complete for nondeterministic log space
- On a complexity hierarchy between L and NL
- On tape-bounded complexity classes and multihead finite automata
- Space-bounded reducibility among combinatorial problems
- Symmetric space-bounded computation
- The iterated mod problem
- `` Strong NP-Completeness Results
Cited in
(8)- On a complexity hierarchy between L and NL
- Knapsack in graph groups
- Remarks on 0-1 optimization problems with superincreasing and superdecreasing objective functions
- scientific article; zbMATH DE number 7204396 (Why is no real title available?)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis
- Compressed membership problems for regular expressions and hierarchical automata
- On computational power of partially blind automata
- On partially blind multihead finite automata.
This page was built for publication: Knapsack problems for NL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673615)