Uniform polylogarithmic space completeness

Flavio Ferrarotti, S. G., Schewe, K., & Torres, J. M. T. (2022). Uniform polylogarithmic space completeness.

Type

Unclassified

Intellectual base

Unclassified

Year

2022

DOI

10.3389/fcomp.2022.845990

Link

https://doi.org/10.3389/fcomp.2022.845990

Cited by

1 citation across 1 artifact.

Domain-specific

• PolyL
  • For example, the distinction between constitutive identity and a convenient observable transfers from Every language in L belongs to PolyL because logarithmic space is the k=1 case. to A complexity statement distinguishes PolyL from polynomial time and records uniformity, machine and constructibility assumptions..

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