Class Description

TC⁰(FOLL): Languages that are TC⁰ Turing reducible to FOLL

The class of decision problems that are reducible to FOLL languages under TC⁰-computable Turing reductions.

For an Abelian group G and an arbitrary group H given by their multiplication tables, deciding whether G and H are isomorphic belongs to TC⁰(FOLL). [CTW13].

Linked From

No class.