{"@context":{"owl":"http://www.w3.org/2002/07/owl#","bibo":"http://purl.org/ontology/bibo/","foaf":"http://xmlns.com/foaf/0.1/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/"},"@id":"https://ci.nii.ac.jp/ncid/BB29524117.json","@graph":[{"@id":"https://ci.nii.ac.jp/ncid/BB29524117#entity","@type":"bibo:Book","foaf:isPrimaryTopicOf":{"@id":"https://ci.nii.ac.jp/ncid/BB29524117.json"},"dc:title":[{"@value":"Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy"}],"dc:creator":"Ronald de Haan","dc:publisher":[{"@value":"Springer"}],"dcterms:extent":"xi, 398 p.","cinii:size":"24 cm","dc:language":"eng","dc:date":"2019","cinii:ncid":"BB29524117","cinii:ownerCount":"2","foaf:maker":[{"@type":"foaf:Person","foaf:name":[{"@value":"de Haan, Ronald"}]}],"bibo:owner":[{"@id":"https://ci.nii.ac.jp/library/FA022743","@type":"foaf:Organization","foaf:name":"京都大学 大学院 情報学研究科","rdfs:seeAlso":{"@id":"https://kuline.kulib.kyoto-u.ac.jp/opac/opac_openurl/?ncid=BB29524117"}},{"@id":"https://ci.nii.ac.jp/library/FA002768","@type":"foaf:Organization","foaf:name":"京都大学 数理解析研究所 図書室","rdfs:seeAlso":{"@id":"https://kuline.kulib.kyoto-u.ac.jp/opac/opac_openurl/?ncid=BB29524117"}}],"prism:publicationDate":["c2019"],"cinii:note":["Bibliography: p. 387-396","Includes index"],"dc:subject":["DC23:004"],"dcterms:isPartOf":[{"@id":"https://ci.nii.ac.jp/ncid/BA00009279#entity","dc:title":"Lecture notes in computer science, 11880 . Lecture notes in artificial intelligence . LNCS sublibrary ; SL1 . Theoretical computer science and general issues","@type":"bibo:Book"},{"@id":"https://ci.nii.ac.jp/ncid/BB1637345X#entity","dc:title":"FoLLI publications on logic, language and information","@type":"bibo:Book"}],"dcterms:hasPart":[{"@id":"urn:isbn:9783662606698"}]}]}