This HTML5 document contains 37 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Parsimonious_reduction
dbo:wikiPageWikiLink
dbr:Polynomial-time_counting_reduction
Subject Item
dbr:♯P-complete
dbo:wikiPageWikiLink
dbr:Polynomial-time_counting_reduction
Subject Item
dbr:♯P-completeness_of_01-permanent
dbo:wikiPageWikiLink
dbr:Polynomial-time_counting_reduction
Subject Item
dbr:Polynomial-time_counting_reduction
rdfs:label
Polynomial-time counting reduction
rdfs:comment
In the computational complexity theory of counting problems, a polynomial-time counting reduction is a type of reduction (a transformation from one problem to another) used to define the notion of completeness for the complexity class ♯P. These reductions may also be called polynomial many-one counting reductions or weakly parsimonious reductions; they are analogous to many-one reductions for decision problems and they generalize the parsimonious reductions.
dct:subject
dbc:Reduction_(complexity)
dbo:wikiPageID
59141049
dbo:wikiPageRevisionID
1071444636
dbo:wikiPageWikiLink
dbr:Decision_problem dbr:Function_composition dbr:NP_(complexity) dbr:Sharp-P-completeness_of_01-permanent dbc:Reduction_(complexity) dbr:Reduction_(complexity) dbr:Non-deterministic_Turing_machine dbr:Identity_function dbr:Computational_complexity_theory dbr:Algorithm dbr:Many-one_reduction dbr:Turing_reduction dbr:Parsimonious_reduction dbr:Counting_problem_(complexity) dbr:♯P-complete dbr:Identity_(mathematics) dbr:Complete_(complexity) dbr:Polynomial_time dbr:♯P
owl:sameAs
wikidata:Q60791841 n14:9FxJp
dbp:wikiPageUsesTemplate
dbt:R dbt:Reflist dbt:Short_description
dbo:abstract
In the computational complexity theory of counting problems, a polynomial-time counting reduction is a type of reduction (a transformation from one problem to another) used to define the notion of completeness for the complexity class ♯P. These reductions may also be called polynomial many-one counting reductions or weakly parsimonious reductions; they are analogous to many-one reductions for decision problems and they generalize the parsimonious reductions.
prov:wasDerivedFrom
wikipedia-en:Polynomial-time_counting_reduction?oldid=1071444636&ns=0
dbo:wikiPageLength
6037
foaf:isPrimaryTopicOf
wikipedia-en:Polynomial-time_counting_reduction
Subject Item
wikipedia-en:Polynomial-time_counting_reduction
foaf:primaryTopic
dbr:Polynomial-time_counting_reduction