Matches in DBpedia 2014 for { <http://dbpedia.org/resource/LH_(complexity)> ?p ?o. }
Showing items 1 to 18 of
18
with 100 items per page.
- LH_(complexity) abstract "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 special case of the hierarchy of bounded alternating Turing machines. It is equal to FO and to FO-uniform AC0.The th level of the logarithmic time hierarchy is the set of languages recognised by alternating Turing machines in logarithmic time with random access and alternations, beginning with an existential state. LH is the union of all levels.".
- LH_(complexity) wikiPageID "27998286".
- LH_(complexity) wikiPageRevisionID "535759588".
- LH_(complexity) hasPhotoCollection LH_(complexity).
- LH_(complexity) subject Category:Complexity_classes.
- LH_(complexity) type Abstraction100002137.
- LH_(complexity) type Class107997703.
- LH_(complexity) type Collection107951464.
- LH_(complexity) type ComplexityClasses.
- LH_(complexity) type Group100031264.
- LH_(complexity) comment "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 special case of the hierarchy of bounded alternating Turing machines.".
- LH_(complexity) label "LH (complexity)".
- LH_(complexity) sameAs m.0ch12qn.
- LH_(complexity) sameAs Q6458573.
- LH_(complexity) sameAs Q6458573.
- LH_(complexity) sameAs LH_(complexity).
- LH_(complexity) wasDerivedFrom LH_(complexity)?oldid=535759588.
- LH_(complexity) isPrimaryTopicOf LH_(complexity).