Computational complexity, lecture 8

Parys, P. (2018). Computational complexity, lecture 8.

Type

Unclassified

Intellectual base

Unclassified

Year

2018

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Unary language
  • A unary or tally language is a subset of {1}*, so membership depends only on the length of the input string.

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:30aecb0290e0 · see in the full table