Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Sharp-P-completeness_of_01-permanent> ?p ?o }
Showing triples 1 to 62 of
62
with 100 triples per page.
- Sharp-P-completeness_of_01-permanent abstract "The #P-completeness of 01-permanent, sometimes known as Valiant's theorem, is a mathematical proof about the permanent of matrices, considered a seminal result in computational complexity theory. In a 1979 scholarly paper, Leslie Valiant proved that the computational problem of computing the permanent of a matrix is #P-hard, even if the matrix is restricted to have entries that are all 0 or 1. In this restricted case, computing the permanent is even #P-complete, because it corresponds to the #P problem of counting the number of permutation matrices one can get by changing ones into zeroes.Valiant's 1979 paper also introduced #P as a complexity class.".
- Sharp-P-completeness_of_01-permanent wikiPageID "20768719".
- Sharp-P-completeness_of_01-permanent wikiPageLength "24197".
- Sharp-P-completeness_of_01-permanent wikiPageOutDegree "45".
- Sharp-P-completeness_of_01-permanent wikiPageRevisionID "695008277".
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Academic_publishing.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Adjacency_matrix.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Binary_number.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Bipartite_graph.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Boolean_satisfiability_problem.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Category:Article_proofs.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Category:Combinatorics.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Category:Computational_problems.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Complexity_class.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Computational_complexity_theory.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Computational_problem.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Computing_the_permanent.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Conjunctive_normal_form.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Cook–Levin_theorem.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink File:Permanent-2powers01.png.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink File:Permanent-Nonneg2Powers.png.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Function_problem.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Hopcroft–Karp_algorithm.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Immanant_of_a_matrix.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Ketan_Mulmuley.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Leslie_Valiant.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Matching_(graph_theory).
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Mathematical_proof.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Matrix_(mathematics).
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Modular_arithmetic.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink NC_(complexity).
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Parallel_algorithm.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Permanent.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Polynomial_hierarchy.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Sharp-P.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Sharp-P-complete.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Sharp-SAT.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLink Todas_theorem.
- Sharp-P-completeness_of_01-permanent wikiPageWikiLinkText "Sharp-P-completeness of 01-permanent".
- Sharp-P-completeness_of_01-permanent reason "hash".
- Sharp-P-completeness_of_01-permanent title "#P-completeness of 01-permanent".
- Sharp-P-completeness_of_01-permanent wikiPageUsesTemplate Template:Anchor.
- Sharp-P-completeness_of_01-permanent wikiPageUsesTemplate Template:Correct_title.
- Sharp-P-completeness_of_01-permanent wikiPageUsesTemplate Template:Cquote.
- Sharp-P-completeness_of_01-permanent wikiPageUsesTemplate Template:Harvtxt.
- Sharp-P-completeness_of_01-permanent wikiPageUsesTemplate Template:MOS.
- Sharp-P-completeness_of_01-permanent wikiPageUsesTemplate Template:Reflist.
- Sharp-P-completeness_of_01-permanent subject Category:Article_proofs.
- Sharp-P-completeness_of_01-permanent subject Category:Combinatorics.
- Sharp-P-completeness_of_01-permanent subject Category:Computational_problems.
- Sharp-P-completeness_of_01-permanent hypernym Proof.
- Sharp-P-completeness_of_01-permanent type TelevisionShow.
- Sharp-P-completeness_of_01-permanent type Combinatoric.
- Sharp-P-completeness_of_01-permanent type Field.
- Sharp-P-completeness_of_01-permanent type Proof.
- Sharp-P-completeness_of_01-permanent comment "The #P-completeness of 01-permanent, sometimes known as Valiant's theorem, is a mathematical proof about the permanent of matrices, considered a seminal result in computational complexity theory. In a 1979 scholarly paper, Leslie Valiant proved that the computational problem of computing the permanent of a matrix is #P-hard, even if the matrix is restricted to have entries that are all 0 or 1.".
- Sharp-P-completeness_of_01-permanent label "Sharp-P-completeness of 01-permanent".
- Sharp-P-completeness_of_01-permanent sameAs Q7169283.
- Sharp-P-completeness_of_01-permanent sameAs m.0874f5.
- Sharp-P-completeness_of_01-permanent sameAs Q7169283.
- Sharp-P-completeness_of_01-permanent wasDerivedFrom Sharp-P-completeness_of_01-permanent?oldid=695008277.
- Sharp-P-completeness_of_01-permanent isPrimaryTopicOf Sharp-P-completeness_of_01-permanent.