{“状态”:“确定”,“消息类型”:“工作”,“信息版本”:“1.0.0”,“邮件”:{“索引”:{-“日期-部件”:[[2023,10,12],“日期-时间”:“2023-10-12T22:32:29Z”,“时间戳”:1697149949630},“参考-计数”:27,“出版商”:“剑桥大学出版社(CUP)”,“发行”:“2”,“许可证”:[{“开始”:{“日期-零件”:[2014,3,12]],“日期时间”:“2014-03-12T00:00:00Z”,“时间戳”:1394582400000},“content-version”:“unspecified”,“delay-in-days”:2476,“URL”:“https:\/\/www.cambridge.org\/core\/terms”}],“content-domain”:{“domain”:[],“crossmark-restriction”:false},”short-container-title“:[”J.symb.log.“],”published-print“:{”date-parts“:[[2007,6]}”,“abstract”:“”摘要<\/jats:title>我们给出了可在有界算术理论中定义的NP搜索问题的组合和计算特征.<\/jats:p>“,”DOI“:”10.2178\/jsl\/1185803628“,”type“:”journal-article“,”created“:{”date-parts“:[2007,12,19]],”date-time“:”2007-12-19T16:24:48Z“,”timestamp“:1198081488000},”page“:017“,”卷“:”72“,”author“:[{”given“:”Jan“,”family“:”Kraj\u00ed\u010dek“,”sequence“:”first“,”affiliation“:[]},{”fixed“:”Alan“,”家庭“:”Skelley“,”序列“:”additional“,”filiation”:[]{“given”:“Neil”,“family”:“Thapen”,“sequence”:“additional”,“affiliance”:[]},“member”:“56”,“published-on-line”:{“date-parts”:[[2014,3,12]]},“参考”:[{“密钥”:“S0022481200005405_ref026“,“首页”:“308\u2013312”,“卷标”:“计算机科学逻辑学报”,“卷”:“553”,“作者”:“Pudl\u00e1k”,“年份”:“1992”},{“key”:“S0022481 200005405_ ref025”,“doi-asserted-by”:“publisher”,“doi”:“10.1007 \/BF01200117”}by“:”publisher“,”doi“:”10.1007\/BFb0075316“},{“key“:”S0022481200005405_ref022“,”doi-asserted-by“:”publisher“,”doi“:”10.1016\/S0022-0000(05)80063-7“},{“key”:“S0022481 200005405_ ref021”,“首页”:“229\u2013234”,“volume-title”:“第20届ACM计算理论研讨会”,“author”:“Papadimitriou”,“year”:“1988”},“key“”:“SO0022481250005405_ref017”,“doi-asserted-by”:“publisher”,“doi”:“10.1007 \/BF01531024“},{“key”:“S0022481200005405_ref016”,“doi-asserted-by”:“publisher”,“doi”:“10.1002 \/rsa.3240070103”},“key“:”S0022481 200005405_ ref015“,”doi-assert-by“:”publisher“,”doi“:”10.1002\/malq.19900360106“}”,{,“doi”:“10.4064\/fm170-1-8”},{“key”:“S0022481200005405_ref011”,“doi-asserted-by“:”publisher“,”doi“:”10.1016\/0022-0000(88)90046-3“},{“key”:“S0022481200005405_ref010”,“首页”:“375\u2013377”,“article-title”:“关于有界算术理论之间保守性关系的注释”,“volume”:”48“,“author”:“Impagliazzo”,“year”:“2002”,“journal-title“:”数学逻辑Quaterly“}”,{“,”非结构化”:“Hanika J.,搜索问题和有界算法,博士论文,布拉格查尔斯大学,2004年,可通过ECCC获得(http://\/ECCC.hpi-web.de\/ECCC)。“},{”key“:”S0022481200005405_ref005“,”doi-asserted-by“:”publisher“,“doi”:“10.1007\/s001530050118”},“key”:“S002248.1200005405_ ref004”,“首页”:“1095\u20131115”,“卷”:“63”,“作者”:“Chiari”,“年份”:“1998”,“日志标题”:“见证有界算术和搜索问题中的函数”}、{”key“:“S022481200005405405_ref003”,“首页”:1\u201321“,”article-title“:“布尔复杂性在有界算术分离问题中的应用”,“volume”:“69”,“author”:“Buss”,“year”:“1994”,“journal-title”:“London Mathematical Society Proceedings”},{“key”:”S0022481200005405_ref002“,”volume-title:“有界算术”,“author”:“Buss“,”year“:”1986“}”,{”key“:”S0022481200005405_ref007“,“doi-asserted-by”:“publisher”,“doi”:“10.1016\/0168-0072(94)00059-C”},{“key”:“S0022482120005405_ref024”,“first page”:”1235\u20131244“,”volume“:”53“,”author“:”Paris“,”year“1988”,“journal-title”:“鸽子洞原理的可证明性和无限多素数的存在”}_ref018“,”doi-asserted-by“:”publisher“,”doi“:”10.1006\/jcss.2002.1830“},{“key”:“S0022481200005405_ref020”,“first-page”:“794\u2013801”,“article-title”:“On graph-theoretic lemmata and complexity classes(extended abstract)”,“volume”:”II“,“author”:“Papadimitriou”,”year“:”1990“,”journal-title“:”第31届IEEE计算机科学基础研讨会论文集”},{“key”:“S0022481200005405_ref001”,“doi-asserted-by”:“publisher”,“doi”:“10.1006\/jcss.1998.1575”}、{“密钥”:“SO0022481120005405_ref012”,“非结构化”:“Kraj\u00ed\u010dek Jan,.”}和{“键”:“s0022481250005405_ ref013”,“首页”:“73\u201386”,“卷”:“59”,“作者”:“Kraj\u00ed\u010dek”,“年份”:“1994”,“期刊标题”:“恒定深度命题证明大小的下限”},{“密钥”:“S0022481200005405_ref006”,“第一页”:“83\u201397”,“卷标题”:“第七届美国计算机学会计算理论年度研讨会会议记录”,“作者”:“库克”,“年份”:“1975”},{“密钥”:“S0022481200005405_ref027”,“非结构化”:“Pudl\u00e1k Pavel,《关于有界算术中的u03a31句》,《准备中》。“},{”key“:”S0022481200005405_ref019“,”unstructured“:”Morioka Tsuyoshi,搜索问题复杂性的逻辑方法:证明复杂性,量化命题演算和有界算法,多伦多大学博士论文,2005,可通过ECCC获得(http://\/ECCC.hpi-web.de\/ECCC)。“}doi-asserted-by“:”publisher“,”doi“:”10.1002\/malq.200410005“}],”container-title“:[”Journal of Symbolic Logic“],”original-title”:[],”language“:”en“,”link“:[{”URL“:”https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200005405“,”content-type“:”unspecified“,”content-version“:”vor“,”intended-application““:”相似性检查“}”,“存放”:{“日期-部分”:[[2019,5,1]],“日期-时间”:“2019-05-01T22:12:49Z”,“时间戳”:1556748769000},“分数”:1,“资源“:{”主要“:{”URL“:”https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200005405\/type\/journal_article“}},”副标题“:[],”短标题“:[],”发布“:parts“:[[2007,6]]},”references-count“:27,”journal-issue“:{”issue“:“2”,“published-print”:{“date-parts”:[[2007,6]]}},“alternative-id”:[“S0022481200005405”],“URL”:“http://\/dx.doi.org\/10.2178\/jsl\/1185803628”,“relationship”:{},”ISSN“:[”0022-4812“,”1943-5886“],“ISSN-type”:[{“value”:“0022-486”812“,”类型“:”打印“},{”值“:”1943-5886“,”型号“:”电子“}],”主题“:[],“已发布“:{“date-parts”:[[2007,6]]}}}