Matches in DBpedia 2014 for { <http://dbpedia.org/resource/NL-complete> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items 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 wikiPageRevisionID "549863372".
- NL-complete hasPhotoCollection NL-complete.
- NL-complete subject Category:Complexity_classes.
- NL-complete type Abstraction100002137.
- NL-complete type Class107997703.
- NL-complete type Collection107951464.
- NL-complete type ComplexityClasses.
- NL-complete type Group100031264.
- 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 label "NL完全".
- NL-complete sameAs m.0cbptn.
- NL-complete sameAs Q6954626.
- NL-complete sameAs Q6954626.
- NL-complete sameAs NL-complete.
- NL-complete wasDerivedFrom NL-complete?oldid=549863372.
- NL-complete isPrimaryTopicOf NL-complete.