Facets (new session)
Description
Metadata
Settings
Rule:
ActivityStreamsMap
asEquivalent
b3s
b3sifp
dbprdf-label
facets
http://dbpedia.org/resource/inference/rules/dbpedia#
http://dbpedia.org/resource/inference/rules/opencyc#
http://dbpedia.org/resource/inference/rules/umbel#
http://dbpedia.org/resource/inference/rules/yago#
http://dbpedia.org/schema/property_rules#
http://www.ontologyportal.org/inference/rules/SUMO#
http://www.ontologyportal.org/inference/rules/WordNet#
http://www.w3.org/2002/07/owl#
ldp
oplweb
skos-trans
urn:det:rdf:label
virtrdf-label
virtrdf-url
None
Inverse Functional Properties:
Disabled (fastest)
Apply to subjects only
Apply to objects only
Apply to both subjects and objects
"Same As":
Disabled (fastest)
Apply to subjects only
Apply to objects only
Apply to both subjects and objects (recommended)
Apply to subjects, objects and predicates (not recommended on big datasets)
Apply to predicates only (special use cases only)
About:
Quantum complexity theory
Goto
Sponge
NotDistinct
Permalink
An Entity of Type :
skos:Concept
, within Data Space :
dbpedia.org
associated with source
document(s)
Type:
skos:Concept
New Facet based on Instances of this Class
Attributes
Values
rdf:type
skos:Concept
rdfs:label
Quantum complexity theory
(en)
skos:broader
Quantum information science
Computational complexity theory
skos:prefLabel
Quantum complexity theory
(en)
Wikipage page ID
24092201
(
xsd:integer
)
Wikipage revision ID
549284628
(
xsd:integer
)
dbp:wikiPageUsesTemplate
dbt:Cat_main
prov:wasDerivedFrom
wikipedia-en:Category:Quantum_complexity_theory?oldid=549284628&ns=14
is
dcterms:subject
of
Quantum complexity theory
QCMA
QMA
Bernstein–Vazirani algorithm
Claw finding problem
Communication complexity
Hamiltonian complexity
BQP
Gap-Hamming problem
PP (complexity)
Quantum Turing machine
AWPP (complexity)
Hidden linear function problem
PostBQP
Postselection
Exact quantum polynomial time
is
Link from a Wikipage to another Wikipage
of
Quantum complexity theory
QCMA
QMA
Bernstein–Vazirani algorithm
Claw finding problem
Communication complexity
Hamiltonian complexity
BQP
Gap-Hamming problem
PP (complexity)
Quantum Turing machine
AWPP (complexity)
Hidden linear function problem
PostBQP
Postselection
Exact quantum polynomial time
Faceted Search & Find service v1.17_git139 as of Feb 29 2024
Alternative Linked Data Documents:
ODE
Content Formats:
RDF
ODATA
Microdata
About
OpenLink Virtuoso
version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 46 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software