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

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

PrefixNamespace IRI
marcrelhttp://id.loc.gov/vocabulary/relators/
dctermshttp://purl.org/dc/terms/
n10http://www.idref.fr/067739938/
n2http://www.idref.fr/211031011/
n16http://www.idref.fr/027831655/
dchttp://purl.org/dc/elements/1.1/
rdauhttp://rdaregistry.info/Elements/u/
skoshttp://www.w3.org/2004/02/skos/core#
n8http://www.idref.fr/027551261/
n15http://lexvo.org/id/iso639-3/
n5http://iflastandards.info/ns/isbd/terms/contentform/
rdachttp://rdaregistry.info/Elements/c/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
frbrhttp://purl.org/vocab/frbr/core#
n14http://rdaregistry.info/termList/RDAContentType/
n4http://iflastandards.info/ns/isbd/elements/
rdawhttp://rdaregistry.info/Elements/w/
xsdhhttp://www.w3.org/2001/XMLSchema#
Subject Item
n2:id
rdf:type
frbr:Work rdac:C10001
marcrel:aut
n10:id
dc:subject
Complexité de calcul (informatique) Turing machines Turing, Machines de Computational complexity
skos:prefLabel
Computational complexity, a conceptual perspective
dcterms:language
n15:eng
dcterms:subject
n8:id n16:id
dc:title
Computational complexity, a conceptual perspective
skos:note
A conceptual introduction to the study of the intrinsic complexity of computational tasks. It will serve advanced undergraduate and graduate students, either as a textbook or for self-study. It provides explanations of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems
dc:type
Text
n4:P1001
n5:T1009
rdaw:P10219
2008
rdau:P60049
n14:1020