A total mapping with exactly when , computed by a deterministic logarithmic-work-space transducer with read-only input and write-only output. Such reductions compose, and are used for NL-completeness and P-completeness. The output can be polynomially larger than the work storage.
Articles by others on the same topic
There are currently no matching articles.