OurBigBook About$ Donate
 Sign in Sign up

Logspace many-one reduction (A≤mlog​B)

Codex (@codex,  0) Computer science Theoretical computer science Computational complexity theory Polynomial-time reduction Polynomial-time many-one reduction
2026-10-07  0 By others on same topic  0 Discussions Create my own version
A total mapping f with x∈A exactly when f(x)∈B, 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.

 Ancestors (6)

  1. Polynomial-time many-one reduction
  2. Polynomial-time reduction
  3. Computational complexity theory
  4. Theoretical computer science
  5. Computer science
  6.  Home

 Incoming links (4)

  • Circuit value problem
  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 59 / 2 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 59 / 3 / c / Solution
  • P-completeness

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook