Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
♯P-complete
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Complexity class
Property
Value
dbo:
description
clase de complejidad
(es)
classe de complexitat
(ca)
classe di complessità
(it)
complexity class
(en)
classe de complexité
(fr)
dbo:
wikiPageWikiLink
dbr
:Partially_ordered_set
dbr
:Perfect_matching
dbr
:FP_(complexity)
dbr
:Turing_reduction
dbr
:Permanent_(mathematics)
dbr
:Computational_complexity_theory
dbr
:Graph_coloring
dbr
:Complexity_class
dbr
:Disjunctive_normal_form
dbr
:Bipartite_graph
dbr
:P_versus_NP_problem
dbr
:Leslie_Valiant
dbr
:Mark_Jerrum
dbr
:NP_(complexity)
dbr
:Vijay_Vazirani
dbr
:Topological_sorting
dbr
:Matching_(graph_theory)
dbr
:Directed_acyclic_graph
dbr
:Polynomial-time_approximation_scheme
dbr
:PH_(complexity)
dbr
:P_(complexity)
dbr
:♯P-completeness_of_01-permanent
dbr
:♯P
dbr
:2-satisfiability
dbc
:Complexity_classes
dbr
:Linear_extension
dbr
:Sharp-SAT
dbr
:Parsimonious_reduction
dbr
:Polynomial-time_counting_reduction
dbr
:NP-complete
dbr
:Probabilistic_algorithm
dbr
:Non-deterministic_Turing_machine
dbr
:Polynomial-time
dbr
:1-satisfiability
dbp:
wikiPageUsesTemplate
dbt
:Cite_book
dbt
:Anchor
dbt
:Correct_title
dbt
:Short_description
dbt
:ComplexityClasses
dct:
subject
dbc
:Complexity_classes
rdfs:
label
♯P-complete
(en)
♯P-complet
(ca)
Numeral-P-completo
(es)
Sharp-P-complet
(fr)
Sharp-P-completo
(it)
샤프-P-완전
(ko)
P-Sharp completude
(pt)
owl:
sameAs
wikidata
:♯P-complete
dbpedia-es
:♯P-complete
dbpedia-it
:♯P-complete
dbpedia-fr
:♯P-complete
dbpedia-pt
:♯P-complete
dbpedia-ko
:♯P-complete
dbpedia-ca
:♯P-complete
dbpedia-global
:♯P-complete
prov:
wasDerivedFrom
wikipedia-en
:♯P-complete?oldid=1302039055&ns=0
foaf:
isPrimaryTopicOf
wikipedia-en
:♯P-complete
is
dbo:
wikiPageRedirects
of
dbr
:Sharp-P-complete
dbr
:Sharp-P-complete
dbr
:Number-P-complete
dbr
:Number-P_hard
dbr
:Sharp-P-Complete
dbr
:Sharp-P_hard
dbr
:Sharp_P_complete
is
dbo:
wikiPageWikiLink
of
dbr
:Perfect_matching
dbr
:Polygon_triangulation
dbr
:Polygonalization
dbr
:Graph_automorphism
dbr
:Antichain
dbr
:Stable_marriage_problem
dbr
:♯P
dbr
:Kronecker_coefficient
dbr
:Quantum_supremacy
dbr
:Lattice_of_stable_matchings
dbr
:Order_polytope
dbr
:Sharp-SAT
dbr
:Parsimonious_reduction
dbr
:Polynomial-time_counting_reduction
dbr
:Sharp-P-complete
dbr
:Number-P-complete
dbr
:Number-P_hard
dbr
:Sharp-P-Complete
dbr
:Sharp-P_hard
dbr
:Sharp_P_complete
is
dbp:
data
of
dbr
:Graph_coloring
is
foaf:
primaryTopic
of
wikipedia-en
:♯P-complete
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International