First-order reduction
id:
first-order-reduction-199-16350318
title:
First-order reduction
text:
In computer science, a first-order reduction is a very strong type of reduction between two computational problems in computational complexity theory. 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. Since we have FO ⊊ L , the first-order reductions are stronger reductions than the logspace reductions. Many important complexity classes are closed under first-order reductions, and many of the traditional c
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/First-order_reduction
date created:
date modified:
2021-11-15T13:37:58Z
main entity:
{"identifier":"Q5452200","url":"https://www.wikidata.org/entity/Q5452200"}
image:
fields total:
13
integrity:
13