The complexity of combinatorial problems with succinct input representation

Wagner, K. W. (1986). The complexity of combinatorial problems with succinct input representation.

Type

Unclassified

Intellectual base

Unclassified

Year

1986

DOI

10.1007/bf00289117

Link

https://doi.org/10.1007/bf00289117

Cited by

1 citation across 1 artifact.

Domain-specific

• Counting hierarchy
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:bdfa5fc79064 · see in the full table