Space complexity of alternating Turing machines

Alberts, M. (1985). Space complexity of alternating Turing machines.

Type

Unclassified

Intellectual base

Unclassified

Year

1985

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• DSPACE
  • DSPACE(f(n)) is the class of decision problems decidable by a deterministic machine using O(f(n)) work space.

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:5c7bc05807a9 · see in the full table