Knapsack problems for NL (Q673615)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Knapsack problems for NL	scientific article

Statements

scholarly article

0 references

Knapsack problems for NL (English)

0 references

0 references

Information Processing Letters

0 references

publication date

28 February 1997

0 references

zbMATH Keywords

combinatorial problems

0 references

computational complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0020-0190(95)00017-7

0 references

0 references

Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)

0 references

On a complexity hierarchy between L and NL

0 references

A taxonomy of problems with fast parallel algorithms

0 references

`` Strong '' NP-Completeness Results

0 references

Space-bounded reducibility among combinatorial problems

0 references

New problems complete for nondeterministic log space

0 references

The iterated mod problem

0 references

Symmetric space-bounded computation

0 references

0 references

On tape-bounded complexity classes and multihead finite automata

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0020-0190(95)00017-7

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:673615

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q673615&oldid=34176884"