Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/L_(complexity)> ?p ?o }
Showing triples 1 to 81 of
81
with 100 triples per page.
- L_(complexity) abstract "In computational complexity theory, L (also known as LSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of memory space. Logarithmic space is sufficient to hold a constant number of pointers into the input and a logarithmic number of boolean flags, and many basic logspace algorithms use the memory in this way.".
- L_(complexity) wikiPageID "1149999".
- L_(complexity) wikiPageLength "6673".
- L_(complexity) wikiPageOutDegree "42".
- L_(complexity) wikiPageRevisionID "686730979".
- L_(complexity) wikiPageWikiLink Binary_decision_diagram.
- L_(complexity) wikiPageWikiLink Cambridge_University_Press.
- L_(complexity) wikiPageWikiLink Category:Complexity_classes.
- L_(complexity) wikiPageWikiLink Clique_(graph_theory).
- L_(complexity) wikiPageWikiLink Complete_(complexity).
- L_(complexity) wikiPageWikiLink Complexity_class.
- L_(complexity) wikiPageWikiLink Computational_complexity_theory.
- L_(complexity) wikiPageWikiLink Computational_resource.
- L_(complexity) wikiPageWikiLink Computers_and_Intractability.
- L_(complexity) wikiPageWikiLink Connected_component_(graph_theory).
- L_(complexity) wikiPageWikiLink DNA.
- L_(complexity) wikiPageWikiLink Decision_problem.
- L_(complexity) wikiPageWikiLink Directed_graph.
- L_(complexity) wikiPageWikiLink FL_(complexity).
- L_(complexity) wikiPageWikiLink FO_(complexity).
- L_(complexity) wikiPageWikiLink First-order_logic.
- L_(complexity) wikiPageWikiLink Function_problem.
- L_(complexity) wikiPageWikiLink Graph_(discrete_mathematics).
- L_(complexity) wikiPageWikiLink Graph_theory.
- L_(complexity) wikiPageWikiLink poly.
- L_(complexity) wikiPageWikiLink List_of_unsolved_problems_in_computer_science.
- L_(complexity) wikiPageWikiLink Log-space_reduction.
- L_(complexity) wikiPageWikiLink Logarithm.
- L_(complexity) wikiPageWikiLink Low_(complexity).
- L_(complexity) wikiPageWikiLink NC_(complexity).
- L_(complexity) wikiPageWikiLink NL_(complexity).
- L_(complexity) wikiPageWikiLink Non-deterministic_Turing_machine.
- L_(complexity) wikiPageWikiLink Null_(SQL).
- L_(complexity) wikiPageWikiLink Omer_Reingold.
- L_(complexity) wikiPageWikiLink P_(complexity).
- L_(complexity) wikiPageWikiLink Pointer_(computer_programming).
- L_(complexity) wikiPageWikiLink Query_language.
- L_(complexity) wikiPageWikiLink Random-access_memory.
- L_(complexity) wikiPageWikiLink Reachability.
- L_(complexity) wikiPageWikiLink Relational_algebra.
- L_(complexity) wikiPageWikiLink Relational_database.
- L_(complexity) wikiPageWikiLink SL_(complexity).
- L_(complexity) wikiPageWikiLink Transitive_closure.
- L_(complexity) wikiPageWikiLink Turing_machine.
- L_(complexity) wikiPageWikiLinkText "'''L'''".
- L_(complexity) wikiPageWikiLinkText "L (complexity)".
- L_(complexity) wikiPageWikiLinkText "L".
- L_(complexity) wikiPageWikiLinkText "L-complete".
- L_(complexity) wikiPageWikiLinkText "LSPACE".
- L_(complexity) wikiPageWikiLinkText "a logarithmic amount of memory space".
- L_(complexity) wikiPageWikiLinkText "deterministic logspace".
- L_(complexity) wikiPageWikiLinkText "log space".
- L_(complexity) wikiPageWikiLinkText "logarithmic space complexity".
- L_(complexity) wikiPageWikiLinkText "logarithmic space".
- L_(complexity) wikiPageWikiLinkText "logarithmic-space".
- L_(complexity) wikiPageWikiLinkText "logspace".
- L_(complexity) wikiPageUsesTemplate Template:Cite_book.
- L_(complexity) wikiPageUsesTemplate Template:ComplexityClasses.
- L_(complexity) wikiPageUsesTemplate Template:Reflist.
- L_(complexity) subject Category:Complexity_classes.
- L_(complexity) hypernym Class.
- L_(complexity) type Class.
- L_(complexity) comment "In computational complexity theory, L (also known as LSPACE or DLOGSPACE) is the complexity class containing decision problems that can be solved by a deterministic Turing machine using a logarithmic amount of memory space. Logarithmic space is sufficient to hold a constant number of pointers into the input and a logarithmic number of boolean flags, and many basic logspace algorithms use the memory in this way.".
- L_(complexity) label "L (complexity)".
- L_(complexity) sameAs Q1192782.
- L_(complexity) sameAs L_(clase_de_complexidá).
- L_(complexity) sameAs L_(Komplexitätsklasse).
- L_(complexity) sameAs L_(komplikeco).
- L_(complexity) sameAs L_(clase_de_complejidad).
- L_(complexity) sameAs L_(complexité).
- L_(complexity) sameAs L_(complessità).
- L_(complexity) sameAs L_(計算複雑性理論).
- L_(complexity) sameAs L_(복잡도).
- L_(complexity) sameAs LSPACE.
- L_(complexity) sameAs m.04bl8m.
- L_(complexity) sameAs L_(сложеност).
- L_(complexity) sameAs L_(độ_phức_tạp).
- L_(complexity) sameAs Q1192782.
- L_(complexity) sameAs L_(複雜度).
- L_(complexity) wasDerivedFrom L_(complexity)?oldid=686730979.
- L_(complexity) isPrimaryTopicOf L_(complexity).