{"id":"https://openalex.org/W1985204981","doi":"https://doi.org/10.1142/s0129054191000133","title":"ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS","display_name":"ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS","publication_year":1991,"publication_date":"1991-09-01","ids":{"openalex":"https://openalex.org/W1985204981","doi":"https://doi.org/10.1142/s0129054191000133","mag":"1985204981"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054191000133","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054191000133","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2433/82102","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101483230","display_name":"Zhi\u2010Zhong Chen","orcid":"https://orcid.org/0000-0003-3061-1171"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"ZHI-ZHONG CHEN","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5053366001","display_name":"Seinosuke Toda","orcid":null},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"SEINOSUKE TODA","raw_affiliation_strings":["Department of Computer Science and Information Mathematics, University of Electro-Communications, Chofugaoka 1\u20135\u20131, Chufo-shi, Tokyo 182, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Mathematics, University of Electro-Communications, Chofugaoka 1\u20135\u20131, Chufo-shi, Tokyo 182, Japan","institution_ids":["https://openalex.org/I20529979"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101483230"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0263,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.72868707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"02","issue":"03","first_page":"207","last_page":"220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.7323354482650757},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6597199440002441},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6286260485649109},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5875701308250427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5636157989501953},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.5465871095657349},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.532900869846344},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5200009942054749},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5187423825263977},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.49572551250457764},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4581926763057709},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.4356743097305298},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4319339990615845},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.41429635882377625},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3518352508544922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3196564316749573},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.2349880039691925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2171943187713623}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7323354482650757},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6597199440002441},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6286260485649109},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5875701308250427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5636157989501953},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.5465871095657349},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.532900869846344},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5200009942054749},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5187423825263977},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.49572551250457764},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4581926763057709},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.4356743097305298},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4319339990615845},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.41429635882377625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3518352508544922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3196564316749573},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.2349880039691925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2171943187713623},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054191000133","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054191000133","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:irdb.nii.ac.jp:01221:0000049413","is_oa":true,"landing_page_url":"http://hdl.handle.net/2433/82102","pdf_url":null,"source":{"id":"https://openalex.org/S7407056385","display_name":"Institutional Repositories DataBase (IRDB)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184597095","host_organization_name":"National Institute of Informatics","host_organization_lineage":["https://openalex.org/I184597095"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"\u6570\u7406\u89e3\u6790\u7814\u7a76\u6240\u8b1b\u7a76\u9332","raw_type":"departmental bulletin paper"}],"best_oa_location":{"id":"pmh:oai:irdb.nii.ac.jp:01221:0000049413","is_oa":true,"landing_page_url":"http://hdl.handle.net/2433/82102","pdf_url":null,"source":{"id":"https://openalex.org/S7407056385","display_name":"Institutional Repositories DataBase (IRDB)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184597095","host_organization_name":"National Institute of Informatics","host_organization_lineage":["https://openalex.org/I184597095"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"\u6570\u7406\u89e3\u6790\u7814\u7a76\u6240\u8b1b\u7a76\u9332","raw_type":"departmental bulletin paper"},"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2032491581","https://openalex.org/W2911941995","https://openalex.org/W2170767514","https://openalex.org/W1419862891","https://openalex.org/W3126743327","https://openalex.org/W2188580701","https://openalex.org/W2053392269","https://openalex.org/W2004966370","https://openalex.org/W3102789953","https://openalex.org/W2549774298"],"abstract_inverted_index":{"We":[0,119,164],"study":[1],"the":[2,21,33,70,97,158,193,260],"computational":[3,56],"complexity":[4,61],"of":[5,23,35,50,72,81,99,108,138,144,157,200,239,248,255],"computing":[6,73],"optimal":[7,74,85,155,176,244],"solutions":[8,10,25,75,177,245],"(the":[9],"themselves,":[11],"not":[12],"just":[13],"their":[14,36],"cost)":[15],"for":[16,76,123,168,246],"NP":[17,45,113,149],"optimization":[18,46],"problems":[19,71],"where":[20],"costs":[22],"feasible":[24],"are":[26,231,253],"bounded":[27,131],"above":[28],"by":[29,41],"a":[30,55,60,79,129,198,207,214],"polynomial":[31],"in":[32,102,187,227,233],"length":[34],"instances":[37,247],"(we":[38],"simply":[39],"denote":[40],"NPOP":[42,125,216],"such":[43],"an":[44,136,148,240],"problem).":[47],"It":[48],"is":[49,178,213,222],"particular":[51],"interest":[52],"to":[53,112,147],"find":[54],"structure":[57],"(or":[58],"equivalently,":[59],"class)":[62],"which.":[63],"captures":[64,116],"that":[65,93,117,122,167,210],"complexity,":[66],"if":[67,211],"we":[68,90,196,205,262],"consider":[69],"NPOP\u2019s":[77],"as":[78,181,184],"class":[80,98],"functions":[82,100,186,226],"giving":[83,174,243],"those":[84,175],"solutions.":[86],"In":[87],"this":[88,256],"paper,":[89],"will":[91],"observe":[92],"[Formula:":[94,188,228],"see":[95,189,229],"text]":[96,230],"computable":[101,232],"polynomial-time":[103,130,234],"with":[104,160,235],"one":[105,141,236],"free":[106,142,237],"evaluation":[107,143,238],"unbounded":[109],"parallel":[110,145],"queries":[111,146],"oracle":[114,150],"sets,":[115],"complexity.":[118],"first":[120],"show":[121,166,192,206],"any":[124,172],"\u03a0,":[126,139],"there":[127],"exists":[128],"randomized":[132],"algorithm":[133],"which,":[134],"given":[135],"instance":[137,159],"uses":[140],"set":[151],"and":[152,204,217,275],"outputs":[153],"some":[154],"solution":[156],"very":[161],"high":[162],"probability.":[163],"then":[165,224],"several":[169],"natural":[170],"NPOP\u2019s,":[171,201,261],"function":[173,242],"at":[179],"least":[180],"computationally":[182],"hard":[183],"all":[185,225],"text].":[190],"To":[191],"hardness":[194,251],"results,":[195],"introduce":[197],"property":[199],"called":[202],"paddability,":[203],"general":[208,257],"result":[209],"\u03a0":[212],"paddable":[215],"its":[218],"associated":[219],"decision":[220],"problem":[221],"NP-hard,":[223],"arbitrary":[241],"\u03a0.":[249],"The":[250],"results":[252],"applications":[254],"result.":[258],"Among":[259],"include":[263],"MAXIMUM":[264],"CLIQUE,":[265],"MINIMUM":[266],"COLORING,":[267],"LONGEST":[268,270],"PATH,":[269],"CYCLE,":[271],"0\u20131":[272,276],"TRAVELING":[273],"SALESPERSON,":[274],"INTEGER":[277],"PROGRAMMING.":[278]},"counts_by_year":[{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}