Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Pseudo-polynomial_time> ?p ?o }
Showing triples 1 to 59 of
59
with 100 triples per page.
- Pseudo-polynomial_time abstract "In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is polynomial in the numeric value of the input, but is exponential in the length of the input – the number of bits required to represent it. An NP-complete problem with known pseudo-polynomial time algorithms is called weakly NP-complete.An NP-complete problem is called strongly NP-complete if it is proven that it cannot be solved by a pseudo-polynomial time algorithm unless P=NP. The strong/weak kinds of NP-hardness are defined analogously.".
- Pseudo-polynomial_time wikiPageID "3149636".
- Pseudo-polynomial_time wikiPageLength "3628".
- Pseudo-polynomial_time wikiPageOutDegree "23".
- Pseudo-polynomial_time wikiPageRevisionID "645657105".
- Pseudo-polynomial_time wikiPageWikiLink AKS_primality_test.
- Pseudo-polynomial_time wikiPageWikiLink Analysis_of_algorithms.
- Pseudo-polynomial_time wikiPageWikiLink Big_O_notation.
- Pseudo-polynomial_time wikiPageWikiLink Category:Analysis_of_algorithms.
- Pseudo-polynomial_time wikiPageWikiLink Category:Complexity_classes.
- Pseudo-polynomial_time wikiPageWikiLink Category:Computational_complexity_theory.
- Pseudo-polynomial_time wikiPageWikiLink Category:Pseudo-polynomial_time_algorithms.
- Pseudo-polynomial_time wikiPageWikiLink Computation_time.
- Pseudo-polynomial_time wikiPageWikiLink Computational_complexity_theory.
- Pseudo-polynomial_time wikiPageWikiLink Computers_and_Intractability.
- Pseudo-polynomial_time wikiPageWikiLink Computers_and_Intractability:_A_Guide_to_the_Theory_of_NP-Completeness.
- Pseudo-polynomial_time wikiPageWikiLink Knapsack_problem.
- Pseudo-polynomial_time wikiPageWikiLink NP-complete.
- Pseudo-polynomial_time wikiPageWikiLink NP-completeness.
- Pseudo-polynomial_time wikiPageWikiLink NP-hard.
- Pseudo-polynomial_time wikiPageWikiLink NP-hardness.
- Pseudo-polynomial_time wikiPageWikiLink P=NP.
- Pseudo-polynomial_time wikiPageWikiLink P_versus_NP_problem.
- Pseudo-polynomial_time wikiPageWikiLink Polynomial.
- Pseudo-polynomial_time wikiPageWikiLink Polynomial_function.
- Pseudo-polynomial_time wikiPageWikiLink Primality_test.
- Pseudo-polynomial_time wikiPageWikiLink Problem_size.
- Pseudo-polynomial_time wikiPageWikiLink Quasi-polynomial_time.
- Pseudo-polynomial_time wikiPageWikiLink Strongly_NP-complete.
- Pseudo-polynomial_time wikiPageWikiLink Time_complexity.
- Pseudo-polynomial_time wikiPageWikiLink Unary_numeral_system.
- Pseudo-polynomial_time wikiPageWikiLink Weakly_NP-complete.
- Pseudo-polynomial_time wikiPageWikiLinkText "Pseudo-polynomial time".
- Pseudo-polynomial_time wikiPageWikiLinkText "pseudo-polynomial time".
- Pseudo-polynomial_time wikiPageWikiLinkText "pseudo-polynomial".
- Pseudo-polynomial_time wikiPageWikiLinkText "pseudo-polynomial-time".
- Pseudo-polynomial_time hasPhotoCollection Pseudo-polynomial_time.
- Pseudo-polynomial_time subject Category:Analysis_of_algorithms.
- Pseudo-polynomial_time subject Category:Complexity_classes.
- Pseudo-polynomial_time subject Category:Computational_complexity_theory.
- Pseudo-polynomial_time subject Category:Pseudo-polynomial_time_algorithms.
- Pseudo-polynomial_time hypernym Polynomial.
- Pseudo-polynomial_time type Algorithm.
- Pseudo-polynomial_time type Class.
- Pseudo-polynomial_time type Concept.
- Pseudo-polynomial_time comment "In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is polynomial in the numeric value of the input, but is exponential in the length of the input – the number of bits required to represent it. An NP-complete problem with known pseudo-polynomial time algorithms is called weakly NP-complete.An NP-complete problem is called strongly NP-complete if it is proven that it cannot be solved by a pseudo-polynomial time algorithm unless P=NP.".
- Pseudo-polynomial_time label "Pseudo-polynomial time".
- Pseudo-polynomial_time sameAs Pseudopolynomiell.
- Pseudo-polynomial_time sameAs Tiempo_pseudo-polinómico.
- Pseudo-polynomial_time sameAs Temps_de_calcul_pseudo-polynomial.
- Pseudo-polynomial_time sameAs Algorytm_pseudowielomianowy.
- Pseudo-polynomial_time sameAs m.08vmbm.
- Pseudo-polynomial_time sameAs Псевдополиномиальный_алгоритм.
- Pseudo-polynomial_time sameAs Псевдополіноміальний_алгоритм.
- Pseudo-polynomial_time sameAs Q155291.
- Pseudo-polynomial_time sameAs Q155291.
- Pseudo-polynomial_time sameAs 伪多项式时间.
- Pseudo-polynomial_time wasDerivedFrom Pseudo-polynomial_time?oldid=645657105.
- Pseudo-polynomial_time isPrimaryTopicOf Pseudo-polynomial_time.