Matches in DBpedia 2014 for { <http://dbpedia.org/resource/LOGCFL> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- LOGCFL abstract "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: evaluating acyclic Boolean conjunctive queries checking the existence of a homomorphism between two acyclic relational structures checking the existence of solutions of acyclic constraint satisfaction problems".
- LOGCFL wikiPageID "4734121".
- LOGCFL wikiPageRevisionID "542469749".
- LOGCFL hasPhotoCollection LOGCFL.
- LOGCFL subject Category:Complexity_classes.
- LOGCFL type Abstraction100002137.
- LOGCFL type Class107997703.
- LOGCFL type Collection107951464.
- LOGCFL type ComplexityClasses.
- LOGCFL type Group100031264.
- LOGCFL comment "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.".
- LOGCFL label "LOGCFL (Komplexitätsklasse)".
- LOGCFL label "LOGCFL".
- LOGCFL label "LOGCFL".
- LOGCFL label "LOGCFL".
- LOGCFL sameAs LOGCFL_(Komplexitätsklasse).
- LOGCFL sameAs LOGCFL.
- LOGCFL sameAs LOGCFL.
- LOGCFL sameAs m.0ckk00.
- LOGCFL sameAs Q448600.
- LOGCFL sameAs Q448600.
- LOGCFL sameAs LOGCFL.
- LOGCFL wasDerivedFrom LOGCFL?oldid=542469749.
- LOGCFL isPrimaryTopicOf LOGCFL.