LOGCFL

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 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 whose instances can be characterized by acyclic hypergraphs:

See also

External links


This article is issued from Wikipedia - version of the 5/8/2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.