Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/RL_(complexity)> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- RL_(complexity) wikiPageID "1176581".
- RL_(complexity) wikiPageLength "3174".
- RL_(complexity) wikiPageOutDegree "16".
- RL_(complexity) wikiPageRevisionID "624295580".
- RL_(complexity) wikiPageWikiLink BPL_(complexity).
- RL_(complexity) wikiPageWikiLink Category:Probabilistic_complexity_classes.
- RL_(complexity) wikiPageWikiLink Complexity_class.
- RL_(complexity) wikiPageWikiLink Computational_complexity_theory.
- RL_(complexity) wikiPageWikiLink Derandomization.
- RL_(complexity) wikiPageWikiLink Deterministic_Turing_machine.
- RL_(complexity) wikiPageWikiLink L_(complexity).
- RL_(complexity) wikiPageWikiLink Logarithmic_space.
- RL_(complexity) wikiPageWikiLink Monte_Carlo_algorithm.
- RL_(complexity) wikiPageWikiLink NL_(complexity).
- RL_(complexity) wikiPageWikiLink Noam_Nisan.
- RL_(complexity) wikiPageWikiLink One-sided_error.
- RL_(complexity) wikiPageWikiLink Polynomial_time.
- RL_(complexity) wikiPageWikiLink Probabilistic_Turing_machine.
- RL_(complexity) wikiPageWikiLink RP_(complexity).
- RL_(complexity) wikiPageWikiLink Randomized_algorithm.
- RL_(complexity) wikiPageWikiLink SC_(complexity).
- RL_(complexity) wikiPageWikiLink SL_(complexity).
- RL_(complexity) wikiPageWikiLink Time_complexity.
- RL_(complexity) wikiPageWikiLink Turing_machine.
- RL_(complexity) wikiPageWikiLinkText "RL (complexity)".
- RL_(complexity) wikiPageWikiLinkText "RL".
- RL_(complexity) wikiPageWikiLinkText "RLP".
- RL_(complexity) wikiPageWikiLinkText "randomized logarithmic space".
- RL_(complexity) hasPhotoCollection RL_(complexity).
- RL_(complexity) wikiPageUsesTemplate Template:Comp-sci-theory-stub.
- RL_(complexity) wikiPageUsesTemplate Template:ComplexityClasses.
- RL_(complexity) wikiPageUsesTemplate Template:Reflist.
- RL_(complexity) subject Category:Probabilistic_complexity_classes.
- RL_(complexity) hypernym Class.
- RL_(complexity) comment "Randomized Logarithmic-space (RL), sometimes called RLP (Randomized Logarithmic-space Polynomial-time), is the complexity class of computational complexity theory problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with one-sided error.".
- RL_(complexity) label "RL (complexity)".
- RL_(complexity) sameAs RL_(Komplexitätsklasse).
- RL_(complexity) sameAs m.04dnx6.
- RL_(complexity) sameAs Q579152.
- RL_(complexity) sameAs Q579152.
- RL_(complexity) sameAs RL_(複雜度).
- RL_(complexity) wasDerivedFrom RL_(complexity)?oldid=624295580.
- RL_(complexity) isPrimaryTopicOf RL_(complexity).