{“id”：“https://openalex.org/W1571189667“，”doi“：”https://doi.org/10.1007/978-3-642-21875-0_12“，”title“：“有限标记林上预订单的复杂性问题”，“display_name”：“有限标签林上预订购的复杂性问题“，”publication_year“：2011，”publiation_date“：”2011-01-01“，”ids“：{”openalex“：”https://openalex.org/W1571189667“，”doi“：”https://doi.org/10.1007/978-3-642-21875-0_12“，”mag“：”1571189667“}，”language“：”en“，”primary_location“：{”is_oa“：false，”landing_page_url“：”https://doi.org/10.1007/978-3-642-21875-0_12“，”pdf_url“：空，”源“：{”id“：”https://openalex.org/S106296714“，”display_name“：”计算机科学讲义“，”issn_l“：”0302-9743“，”isn“：[”0302-7743“、”1611-3349“]，”is_oa“：false、”is_in_doaj“：false、”is_core“：true、”host_organization“：”https://openalex.org/P4310318900“，”“host_organization_name”：“Springer Science+Business Media”，“host_organization_lineage”：[“https://openalex.org/P431031965","https://openalex.org/P4310318900“]，”host_organization_lineage_names“：[”Springer Nature“，”Springer-Science+Business Media“]，“type”：“book-series”}，“license”：null，“licence_id”：nul，“version”：null，“is_accepted”：false，“is_published”：false}，”type“：”book-chapter“，”type_crossref“：“book-chapter”，”indexed_in“：[“crossref”]，”open_access“：{”is_oa“：false”“，”oa_url“：空，”any_repository_has_fulltext“：false｝，”authorships“：[｛”author_position“：”first“，”author“：｛”id“：”https://openalex.org/A5039739158“，”display_name“：”Peter Hertling“，”orcid“：”https://orcid.org/0000-0002-4442-6711}，“机构”：[{“id”：https://openalex.org/I40527276“，”display_name“：”联邦国防军M\u00fcnchen大学“，”ror“：”https://ror.org/05kkv3f82“，”country_code“：”DE“，”type“：“教育”，”世系“：[”https://openalex.org/I40527276","https://openalex.org/I4387152969“]}]，”国家“：[”DE“]，”is_corresponding“：false，”raw_author_name“：”Peter Hertling“，”raw _affiliation_strings“：[“德国纽比堡联邦国防大学数学与运筹学数学信息研究所”]，”从属关系“：[{”raw _affiliation_string“：”德国纽比堡联邦国防大学数学与运筹研究所https://openalex.org/I40527276“]}]}，{”author_position“：”last“，”author“：{”id“：”https://openalex.org/A5035858448“，”display_name“：”Victor Selivanov“，”orcid“：”https://orcid.org/0000-0003-4316-0859}，“机构”：[{“id”：https://openalex.org/I4210092286“，”display_name“：”信息学问题研究所“，”ror“：”https://ror.org/00n8bqs64“，”“country_code”“：”RU“，”type“：”facility“，”lineage“：[”https://openalex.org/I1313323035","https://openalex.org/I4210092286","https://openalex.org/I4210097085“]}]，”国家“：[”RU“]，”is_corresponding“：false，”raw_author_name“：”Victor Selivanov“，”raw _ afiliation_strings“：[“A.P.Ershov Institute of Informatics Systems，Novosibirsk，Russia#TAB#”]，”affiliations“：[{”raw _affiliation_strong“：”A.P.埃尔肖夫institution of Informations Systems，New Sibirsk#TAB##“，”institution_ids“：]”https://openalex.org/I4210092286“]}]}]，”institution_assertions“：[]，”countries_distiction_count“：2，”institutions_disticent_count”：2，“corresponding_author_ids”：[]、“correspending_institution_ids“：[[]，”apc_list“：{“value”：5000，“currency”：“EUR”，“value_usd”：5392，“provenance”：“doaj”}，“apc_payed”：null，“fwci”：0.0，“has_fulltext”：false，“cited_by_”count“：0，”引用规范化百分比“：{”value“：0.0，”is_in_top_1_percent“：false，”is-in_top_10_percennt“：false}，”cited_by_percentile_year“：{”min“：0，”max“：66}，“biblio”：{“volume”：null，“issue”：null，“first_page”：“112”，“last_page”：“121”}，‘is_retracted’：false、“is_paratext”：false；“primary_topic”：{“id”：“https://openalex.org/T2002“，”display_name“：”计算复杂性与算法信息理论“，”score“：0.9999，”subfield“：{”id“：”https://openalex.org/subfields/1703“，”display_name“：”计算理论与数学“}，”字段“：{”id“：”https://openalex.org/fields/17“，”display_name“：”Computer Science“}，”domain“：{”id“：”https://openalex.org/domains/3“，”display_name“：”物理科学“}}，”主题“：[{”id“：”https://openalex.org/T2002“，”display_name“：”计算复杂性与算法信息理论“，”score“：0.9999，”subfield“：{”id“：”https://openalex.org/subfields/1703“，”display_name“：”计算理论与数学“}，”字段“：{”id“：”https://openalex.org/fields/17“，”display_name“：”Computer Science“}，”domain“：{”id“：”https://openalex.org/domains/3“，”display_name“：”物理科学“}}，{”id“：”https://openalex.org/T11567“，”display_name“：”自动机理论与形式语言“，”score“：0.996，”subfield“：{”id“：”https://openalex.org/subfields/1703“，”display_name“：”计算理论与数学“}，”字段“：{”id“：”https://openalex.org/fields/17“，”display_name“：”Computer Science“}，”domain“：{”id“：”https://openalex.org/domains/3“，”display_name“：”物理科学“}}，{”id“：”https://openalex.org/T11727“，”display_name“：”模糊逻辑和剩余格“，”score“：0.9955，”subfield“：｛”id“：”https://openalex.org/subfields/1703“，”display_name“：”计算理论与数学“}，”字段“：{”id“：”https://openalex.org/fields/17“，”display_name“：”Computer Science“}，”domain“：{”id“：”https://openalex.org/domains/3“，”display_name“：”物理科学“}}]，”关键词“：[{”id“：”https://openalex.org/关键字/可计算性“，”display_name“：”Computability“，”score“：0.472837}，{”id“：”https://openalex.org/keywords/internacity（https://openalex.org/关键词/不连续性）“，”display_name“：”不连续性（语言学）“，”score“：0.44822153｝]，”concepts“：[｛”id“：”https://openalex.org/C152062344，“wikidata”：https://www.wikidata.org/wiki/Q818888“，”display_name“：”Computability“，”level“：2，”score“：0.71725094｝，｛”id“：”https://openalex.org/C27318111，“wikidata”：https://www.wikidata.org/wiki/Q5157264“，”display_name“：”可计算分析“，”level“：3，”score“：0.5447607}，{”id“：”https://openalex.org/C9019067，“wikidata”：https://www.wikidata.org/wiki/Q43260“，”display_name“：”多项式“，”level“：2，”score“：0.49945474}，{”id“：”https://openalex.org/C33923547，“wikidata”：https://www.wikidata.org/wiki/Q395网址“，”display_name“：”数学“，”等级“：0，”分数“：0.47338074}，{”id“：”https://openalex.org/C197685441，“wikidata”：https://www.wikidata.org/wiki/Q500716“，”display_name“：”PSPACE“，”level“：3，”score“：0.46814826}，{”id“：”https://openalex.org/C311688，“wikidata”：https://www.wikidata.org/wiki/Q2393193“，”display_name“：”时间复杂性“，”level“：2，”score“：0.46339017}，{”id“：”https://openalex.org/C2777042112，“wikidata”：https://www.wikidata.org/wiki/Q5281658“，”display_name“：”Discontinuity（linguistics）“，”level“：2，”score“：0.44822153}，{”id“：”https://openalex.org/C54271186，“wikidata”：https://www.wikidata.org/wiki/Q1148456“，”display_name“：”可计算函数“，”level“：2，”score“：0.43241304}，{”id“：”https://openalex.org/C41008148，“wikidata”：https://www.wikidata.org/wiki/Q21198“，”display_name“：”计算机科学“，”level“：0，”score“：0.41844139}，{”id“：”https://openalex.org/C136119220，“wikidata”：https://www.wikidata.org/wiki/Q1000660“，”display_name“：”字段代数“，”level“：2，”score“：0.4003768}，{”id“：”https://openalex.org/C118615104，“wikidata”：https://www.wikidata.org/wiki/Q121416“，”display_name“：”离散数学“，”level“：1，”score“：0.3550085}，{”id“：”https://openalex.org/C179799912，“wikidata”：https://www.wikidata.org/wiki/Q205084“，”display_name“：”计算复杂性理论“，”level“：2，”score“：0.34786373}，{”id“：”https://openalex.org/C202444582，“wikidata”：https://www.wikidata.org/wiki/Q837863“，”display_name“：”纯数学“，”level“：1，”score“：0.26317865}，{”id“：”https://openalex.org/C11413529，“wikidata”：https://www.wikidata.org/wiki/Q8366“，”display_name“：”Algorithm“，”level“：1，”score“：0.14167348}，{”id“：”https://openalex.org/C134306372，“wikidata”：https://www.wikidata.org/wiki/Q7754“，”display_name“：”数学分析“，”level“：1，”score“：0.0}]，”mesh“：[]，”locations_count“：1.”locations“：[{”is_oa“：false，”landing_page_url“：”https://doi.org/10.1007/978-3-642-21875-0_12“，”pdf_url“：空，”源“：{”id“：”https://openalex.org/S106296714“，”display_name“：”计算机科学讲义“，”issn_l“：”0302-9743“，”isn“：[”0302-7743“、”1611-3349“]，”is_oa“：false、”is_in_doaj“：false、”is_core“：true、”host_organization“：”https://openalex.org/P4310318900“，”“host_organization_name”：“Springer Science+Business Media”，“host_organization_lineage”：[“https://openalex.org/P431031965","https://openalex.org/P4310318900“]，”host_organization_lineage_names“：[”Springer Nature“，”Springer-Science+Business Media“]，“type”：“book series”}，“license”：null，“licence_id”：null，“version”：null，“is_accepted”：false，“is_published”：false}]，“best_oa_location”：nul，“sustainable_development_goals”：[]，“grants”：[]，“dataset”：[]]，“versions”：[】，“referenced_works_count”：29，“referenced_works“：[”https://openalex.org/W1509579779","https://openalex.org/W1527238007","https://openalex.org/W1537377488","https://openalex.org/W1537811022","https://openalex.org/W1539382740","https://openalex.org/W1588310362","https://openalex.org/W1794701400","https://openalex.org/W179721359","https://openalex.org/W1975790950","https://openalex.org/W1989337779","https://openalex.org/W2043945019","https://openalex.org/W2044468563","https://openalex.org/W2044480288","https://openalex.org/W2063225133网址","https://openalex.org/W2066096553","https://openalex.org/W2093397547","https://openalex.org/W2131577292","https://openalex.org/W2154952077","https://openalex.org/W2611511037","https://openalex.org/W2806893125","https://openalex.org/W2885774045","https://openalex.org/W2896051258","https://openalex.org/W2913688336","https://openalex.org/W3105905549","https://openalex.org/W3106040729","https://openalex.org/W4243563333","https://openalex.org/W4285719527","https://openalex.org/W4292230561","https://openalex.org/W570201416“]，”related_works“：[”https://openalex.org/W98540345","https://openalex.org/W4238402038","https://openalex.org/W4233415116","https://openalex.org/W3196699235","https://openalex.org/W2613746821","https://openalex.org/W2584729637","https://openalex.org/W2046021909","https://openalex.org/W2026991960","https://openalex.org/W1546826212","https://openalex.org/W1533694441“]，”abstract_inverted_index“：{”We“：[0]，”prove“：[1]，”that“：[2,47]，”three“：[3,55]，”preorders“：[4,56,67]，”on“：[5,40,48]，”the“：[6,20,33,41,51,64]，”finited“：[7]，”k-labelled“：[8]，”forests“：[9,50]，”ares“：[10,68]，”多项式“：[11,58]，”time“：[12,59]，”可计算。“：[13]，“一起”：[14]，“with”：[15]，“an”：[16,28]，“earlier”：[17]，“result”：%18]，“of”：[19,32,36,38,53]，“first“：[21,52]，”author“：[22]，”this“：[23]，”implies“：[24]，”polynominal time“：[25]，”computability“：[26]，”for“：[27]，”重要“：[29]，”initial“：[30]，”segment“：[31]，”corresponding“：[34]，”degrees“：[35]，”不连续“：[37]，”k-partitions“：[39]，”Baire“：%42]，“space。“：[43]，”“此外，”：[44]，“we”：[45]，“show”：[46]，“\u03c9-labeled”：[49]，“these”：[54]，“is”：[57]，“computable”：[60]，“as”：[61]，“well”：[62]，“while”：：[63]，“other”：65]，“two”：[66]，“NP-complete。“：[69]}，”cited_by_api_url“：”https://api.openalex.org/works？filter=cites:W1571189667“，”counts_by_year“：[]，”updated_date“：”2024-09-14T08:18:04.252513“，”创建日期“：”2016-06-24“}