Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/NL-complete> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples per page.
- NL-complete abstract "In computational complexity theory, NL-complete is a complexity class containing the languages that are complete for NL, the class of decision problems that can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space. The NL-complete languages are the most "difficult" or "expressive" problems in NL. If a method exists for solving any one of the NL-complete problems in logarithmic memory space, then NL = L.".
- NL-complete wikiPageID "4595166".
- NL-complete wikiPageLength "4365".
- NL-complete wikiPageOutDegree "20".
- NL-complete wikiPageRevisionID "549863372".
- NL-complete wikiPageWikiLink 2-satisfiability.
- NL-complete wikiPageWikiLink Category:Complexity_classes.
- NL-complete wikiPageWikiLink Christos_Papadimitriou.
- NL-complete wikiPageWikiLink Complement_(set_theory).
- NL-complete wikiPageWikiLink Complete_(complexity).
- NL-complete wikiPageWikiLink Complexity_class.
- NL-complete wikiPageWikiLink Computational_complexity_theory.
- NL-complete wikiPageWikiLink Conjunctive_normal_form.
- NL-complete wikiPageWikiLink Decision_problem.
- NL-complete wikiPageWikiLink Immerman–Szelepcsényi_theorem.
- NL-complete wikiPageWikiLink L_(complexity).
- NL-complete wikiPageWikiLink NL_(complexity).
- NL-complete wikiPageWikiLink Non-deterministic_Turing_machine.
- NL-complete wikiPageWikiLink Nondeterministic_Turing_machine.
- NL-complete wikiPageWikiLink P_(complexity).
- NL-complete wikiPageWikiLink Reduction_(complexity).
- NL-complete wikiPageWikiLink ST-connectivity.
- NL-complete wikiPageWikiLink Sardinas–Patterson_algorithm.
- NL-complete wikiPageWikiLink St-connectivity.
- NL-complete wikiPageWikiLink Variable-length_code.
- NL-complete wikiPageWikiLinkText "NL-complete".
- NL-complete wikiPageWikiLinkText "complete".
- NL-complete hasPhotoCollection NL-complete.
- NL-complete wikiPageUsesTemplate Template:Citation.
- NL-complete wikiPageUsesTemplate Template:Harvtxt.
- NL-complete subject Category:Complexity_classes.
- NL-complete hypernym Class.
- NL-complete type Class.
- NL-complete comment "In computational complexity theory, NL-complete is a complexity class containing the languages that are complete for NL, the class of decision problems that can be solved by a nondeterministic Turing machine using a logarithmic amount of memory space. The NL-complete languages are the most "difficult" or "expressive" problems in NL. If a method exists for solving any one of the NL-complete problems in logarithmic memory space, then NL = L.".
- NL-complete label "NL-complete".
- NL-complete sameAs NL-completo.
- NL-complete sameAs m.0cbptn.
- NL-complete sameAs Q6954626.
- NL-complete sameAs Q6954626.
- NL-complete sameAs NL完全.
- NL-complete wasDerivedFrom NL-complete?oldid=549863372.
- NL-complete isPrimaryTopicOf NL-complete.