Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/LOGCFL> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples 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 wikiPageLength "959".
- LOGCFL wikiPageOutDegree "17".
- LOGCFL wikiPageRevisionID "607685060".
- LOGCFL wikiPageWikiLink AC_(complexity).
- LOGCFL wikiPageWikiLink Boolean_conjunctive_query.
- LOGCFL wikiPageWikiLink Category:Complexity_classes.
- LOGCFL wikiPageWikiLink Complete_(complexity).
- LOGCFL wikiPageWikiLink Complexity_class.
- LOGCFL wikiPageWikiLink Computational_complexity_theory.
- LOGCFL wikiPageWikiLink Constraint_satisfaction_problem.
- LOGCFL wikiPageWikiLink Context-free_language.
- LOGCFL wikiPageWikiLink Decision_problem.
- LOGCFL wikiPageWikiLink Directed_acyclic_graph.
- LOGCFL wikiPageWikiLink Homomorphism.
- LOGCFL wikiPageWikiLink Hypergraph.
- LOGCFL wikiPageWikiLink L_(complexity).
- LOGCFL wikiPageWikiLink List_of_complexity_classes.
- LOGCFL wikiPageWikiLink Logarithmic_space.
- LOGCFL wikiPageWikiLink NL_(complexity).
- LOGCFL wikiPageWikiLink Problem_instance.
- LOGCFL wikiPageWikiLink Relational_structure.
- LOGCFL wikiPageWikiLink Structure_(mathematical_logic).
- LOGCFL wikiPageWikiLinkText "LOGCFL".
- LOGCFL hasPhotoCollection LOGCFL.
- LOGCFL wikiPageUsesTemplate Template:CZoo.
- LOGCFL wikiPageUsesTemplate Template:Mathlogic-stub.
- LOGCFL subject Category:Complexity_classes.
- LOGCFL hypernym Class.
- LOGCFL type Class.
- 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".
- LOGCFL sameAs LOGCFL_(Komplexitätsklasse).
- LOGCFL sameAs LOGCFL.
- LOGCFL sameAs LOGCFL.
- LOGCFL sameAs m.0ckk00.
- LOGCFL sameAs Q448600.
- LOGCFL sameAs Q448600.
- LOGCFL wasDerivedFrom LOGCFL?oldid=607685060.
- LOGCFL isPrimaryTopicOf LOGCFL.