Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Generic-case_complexity> ?p ?o }
Showing triples 1 to 70 of
70
with 100 triples per page.
- Generic-case_complexity abstract "Generic-case complexity is a subfield of computational complexity theory that studies the complexity of computational problems on "most inputs".Generic-case complexity is a way of measuring the complexity of a computational problem by neglecting a small set ofunrepresentative inputs and considering worst-case complexity on the rest.Small is defined in terms of asymptotic density.The apparent efficacy of generic case complexity is because for a wide variety of concrete computational problems, the most difficult instances seem to be rare. Typical instances are relatively easy.This approach to complexity originated in combinatorial group theory, which has a computational tradition going back to the beginning of the last century.The notion of generic complexity was introduced in where authors showed that for a large class of finitely generated groups the generic time complexity of some classical decision problems from combinatorial group theory, namely the word problem, conjugacy problem and membership problem, are linear.A detailed introduction of generic case complexity can be found in the surveys,".
- Generic-case_complexity wikiPageID "24731030".
- Generic-case_complexity wikiPageLength "18002".
- Generic-case_complexity wikiPageOutDegree "46".
- Generic-case_complexity wikiPageRevisionID "562792400".
- Generic-case_complexity wikiPageWikiLink Algorithm.
- Generic-case_complexity wikiPageWikiLink Anshel–Anshel–Goldfeld_key_exchange.
- Generic-case_complexity wikiPageWikiLink Average-case_complexity.
- Generic-case_complexity wikiPageWikiLink Average_case_complete_problems.
- Generic-case_complexity wikiPageWikiLink Bounded_halting_problem.
- Generic-case_complexity wikiPageWikiLink Braid_group.
- Generic-case_complexity wikiPageWikiLink Category:Computational_complexity_theory.
- Generic-case_complexity wikiPageWikiLink Combinatorial_group_theory.
- Generic-case_complexity wikiPageWikiLink Computational_complexity_theory.
- Generic-case_complexity wikiPageWikiLink Computational_problem.
- Generic-case_complexity wikiPageWikiLink Conjugacy_problem.
- Generic-case_complexity wikiPageWikiLink Coset_enumeration.
- Generic-case_complexity wikiPageWikiLink Decision_problem.
- Generic-case_complexity wikiPageWikiLink Decision_problems.
- Generic-case_complexity wikiPageWikiLink Exponential_time.
- Generic-case_complexity wikiPageWikiLink Finitely_generated_group.
- Generic-case_complexity wikiPageWikiLink Formal_language.
- Generic-case_complexity wikiPageWikiLink Formal_languages.
- Generic-case_complexity wikiPageWikiLink Free_group.
- Generic-case_complexity wikiPageWikiLink Generating_set_of_a_group.
- Generic-case_complexity wikiPageWikiLink HNN_extension.
- Generic-case_complexity wikiPageWikiLink Halting_problem.
- Generic-case_complexity wikiPageWikiLink Infinite_set.
- Generic-case_complexity wikiPageWikiLink Length_based_attack.
- Generic-case_complexity wikiPageWikiLink Linear_time.
- Generic-case_complexity wikiPageWikiLink Membership_problem.
- Generic-case_complexity wikiPageWikiLink NP-complete_problems.
- Generic-case_complexity wikiPageWikiLink NP-completeness.
- Generic-case_complexity wikiPageWikiLink NP_complete.
- Generic-case_complexity wikiPageWikiLink One-way_function.
- Generic-case_complexity wikiPageWikiLink P_=_NP.
- Generic-case_complexity wikiPageWikiLink P_versus_NP_problem.
- Generic-case_complexity wikiPageWikiLink Polynomial_time.
- Generic-case_complexity wikiPageWikiLink Post_correspondence_problem.
- Generic-case_complexity wikiPageWikiLink Presburger_arithmetic.
- Generic-case_complexity wikiPageWikiLink Probability_distribution.
- Generic-case_complexity wikiPageWikiLink Probability_distributions.
- Generic-case_complexity wikiPageWikiLink Rices_theorem.
- Generic-case_complexity wikiPageWikiLink Satisfiability.
- Generic-case_complexity wikiPageWikiLink Satisfiability_problem.
- Generic-case_complexity wikiPageWikiLink Search_problem.
- Generic-case_complexity wikiPageWikiLink Stolz_theorem.
- Generic-case_complexity wikiPageWikiLink Stolz–Cesàro_theorem.
- Generic-case_complexity wikiPageWikiLink Subset_sum_problem.
- Generic-case_complexity wikiPageWikiLink Time_complexity.
- Generic-case_complexity wikiPageWikiLink Turing_machine.
- Generic-case_complexity wikiPageWikiLink Undecidable_problem.
- Generic-case_complexity wikiPageWikiLink Word_problem_for_groups.
- Generic-case_complexity wikiPageWikiLink Worst-case_complexity.
- Generic-case_complexity wikiPageWikiLinkText "Complexity (generic)".
- Generic-case_complexity wikiPageWikiLinkText "Generic-case complexity".
- Generic-case_complexity wikiPageWikiLinkText "generic-case complexity".
- Generic-case_complexity hasPhotoCollection Generic-case_complexity.
- Generic-case_complexity wikiPageUsesTemplate Template:Reflist.
- Generic-case_complexity subject Category:Computational_complexity_theory.
- Generic-case_complexity hypernym Subfield.
- Generic-case_complexity type Disease.
- Generic-case_complexity comment "Generic-case complexity is a subfield of computational complexity theory that studies the complexity of computational problems on "most inputs".Generic-case complexity is a way of measuring the complexity of a computational problem by neglecting a small set ofunrepresentative inputs and considering worst-case complexity on the rest.Small is defined in terms of asymptotic density.The apparent efficacy of generic case complexity is because for a wide variety of concrete computational problems, the most difficult instances seem to be rare. ".
- Generic-case_complexity label "Generic-case complexity".
- Generic-case_complexity sameAs Complexité_générique_des_algorithmes.
- Generic-case_complexity sameAs m.080b9c_.
- Generic-case_complexity sameAs Q5532647.
- Generic-case_complexity sameAs Q5532647.
- Generic-case_complexity wasDerivedFrom Generic-case_complexity?oldid=562792400.
- Generic-case_complexity isPrimaryTopicOf Generic-case_complexity.