LH (complexity)
id:
lh-complexity-194-10327239
title:
LH (complexity)
text:
In computational complexity, the logarithmic time hierarchy (LH) is the complexity class of all computational problems solvable in a logarithmic amount of computation time on an alternating Turing machine with a bounded number of alternations. It is a particular case of a bounded alternating Turing machine hierarchy. It is equal to FO and to FO-uniform AC0. The i th level of the logarithmic time hierarchy is the set of languages recognised by alternating Turing machines in logarithmic time with
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/LH_(complexity)
date created:
date modified:
2021-05-27T20:08:21Z
main entity:
{"identifier":"Q6458573","url":"https://www.wikidata.org/entity/Q6458573"}
image:
fields total:
13
integrity:
13