LOGCFL
id:
logcfl-232-9638207
title:
LOGCFL
text:
In computational complexity theory, LOGCFL is the complexity class that contains all decision problems that can be reduced in logarithmic space to a context-free language. This class is closed under complementation. It is situated between NL and AC1, in the sense that it contains the former and is contained in the latter. Problems that are complete for LOGCFL include many problems that can be characterized by acyclic hypergraphs: evaluating acyclic Boolean conjunctive queries
checking the existe
brand slug:
wiki
category slug:
encyclopedia
description:
Computational complexity class
original url:
https://en.wikipedia.org/wiki/LOGCFL
date created:
date modified:
2024-04-14T04:23:54Z
main entity:
{"identifier":"Q448600","url":"https://www.wikidata.org/entity/Q448600"}
image:
fields total:
13
integrity:
14