A function $f:\bits^* \to \bits^* $ is polynomial-time computable if there exists a polynomial-time algorithm $F$ mapping $x$ to $f(x)$, $\forall x \in \bits^*$.
PREVIOUSOne-Way Function
Polynomial-time computable
- Mar 13, 2020
Search
A function $f:\bits^* \to \bits^* $ is polynomial-time computable if there exists a polynomial-time algorithm $F$ mapping $x$ to $f(x)$, $\forall x \in \bits^*$.