Encyclopedia > F > First-order reduction
First-order reduction
In computational complexity theory, a first-order reduction is a very weak type of reduction between two computational problems. A first-order reduction is a reduction where each component is restricted to be in the class FO of problems calculable in first-order logic.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)