 ##  [Many-One Reducibility](/many-one-reducibility) 

  ##  [Many-One Reducibility](https://mathlogic.quantumdictionary.io/many-one-reducibility-0) 

  
 [![Mathematics & Logic Dictionary](/sites/default/files/styles/large/public/2026-01/Mathematics%20%26%20Logic.png.webp?itok=UhtTRPnp)](/topic-specific-dictionaries/natural-formal-sciences/mathematics-logic)

- Natural &amp; Formal Sciences -

**Mathematics &amp; Logic Dictionary**

 
Definition

A computability relation between decision problems A and B: A is many-one reducible to B if there exists a computable function f mapping instances x to f(x) such that x is in A exactly when f(x) is in B. The reduction is single-call and nonadaptive.