{"id":"https://openalex.org/W1967557738","doi":"https://doi.org/10.1137/s0097539792234901","title":"Easily Checked Generalized Self-Reducibility","display_name":"Easily Checked Generalized Self-Reducibility","publication_year":1995,"publication_date":"1995-08-01","ids":{"openalex":"https://openalex.org/W1967557738","doi":"https://doi.org/10.1137/s0097539792234901","mag":"1967557738"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792234901","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792234901","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088546793","display_name":"Lane A. Hemaspaandra","orcid":"https://orcid.org/0000-0003-0659-5204"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lane A. Hemaspaandra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056847255","display_name":"Riccardo Silvestri","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Riccardo Silvestri","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5272,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.61139795,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"4","first_page":"840","last_page":"858"},"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.9527999758720398,"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.9527999758720398,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9315000176429749,"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/correctness","display_name":"Correctness","score":0.7345329523086548},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.7077253460884094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5839931964874268},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5485499501228333},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5008418560028076},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4677313268184662},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41453611850738525},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3730100393295288},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35691583156585693},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3265776038169861},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05758213996887207}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7345329523086548},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.7077253460884094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5839931964874268},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5485499501228333},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5008418560028076},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4677313268184662},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41453611850738525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3730100393295288},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35691583156585693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3265776038169861},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05758213996887207}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539792234901","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792234901","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/48651","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/48651","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W31438286","https://openalex.org/W143766875","https://openalex.org/W1535979671","https://openalex.org/W1812177553","https://openalex.org/W1861659322","https://openalex.org/W1986448430","https://openalex.org/W1995286703","https://openalex.org/W2005127553","https://openalex.org/W2010937503","https://openalex.org/W2015323017","https://openalex.org/W2023336906","https://openalex.org/W2027466944","https://openalex.org/W2030549984","https://openalex.org/W2039334189","https://openalex.org/W2039733812","https://openalex.org/W2041317738","https://openalex.org/W2044504659","https://openalex.org/W2051433988","https://openalex.org/W2055734996","https://openalex.org/W2060248327","https://openalex.org/W2066728092","https://openalex.org/W2085634981","https://openalex.org/W2090186532","https://openalex.org/W2093753205","https://openalex.org/W2100820536","https://openalex.org/W2293988196","https://openalex.org/W2905135108"],"related_works":["https://openalex.org/W3008339103","https://openalex.org/W2404647514","https://openalex.org/W1667647204","https://openalex.org/W4247536566","https://openalex.org/W3119814709","https://openalex.org/W2018477250","https://openalex.org/W1508895727","https://openalex.org/W4241418540","https://openalex.org/W2725786787","https://openalex.org/W1604988569"],"abstract_inverted_index":{"This":[0],"paper":[1],"explores":[2],"two":[3,74],"generalizations":[4],"within":[5],"NP":[6],"of":[7,49,53,76,91,103,110,179],"self-reducibility:":[8],"Arvind":[9],"and":[10,14,16,38,106,163],"Biswas\u2019s":[11,17],"kernel":[12,21,87,158,172],"constructibility":[13,173],"Khadilkar":[15],"committability.":[18],"Informally":[19],"stated,":[20],"constructible":[22,88],"sets":[23,40,43,89,101,122,148,155],"have":[24],"(generalized)":[25],"self":[26,78],"reductions":[27],"that":[28,85,98,116,171],"are":[29,41,90,102,123,151,156],"easy":[30],"to":[31,36,62,137,176],"check,":[32],"though":[33],"perhaps":[34],"hard":[35],"compute,":[37],"committable":[39,100],"those":[42],"for":[44,146],"which":[45],"the":[46,63],"potential":[47],"correctness":[48],"a":[50,60,69],"partial":[51],"proof":[52],"set":[54,65],"membership":[55],"can":[56],"be":[57,138],"checked":[58],"via":[59,68],"query":[61],"same":[64],"(that":[66],"is,":[67],"self-reduction).":[70],"We":[71,83,141],"study":[72],"these":[73],"notions":[75,178],"generalized":[77],"reducibility":[79],"on":[80],"nondense":[81,154],"sets.":[82],"show":[84],"sparse":[86,99,119,161],"low":[92,104],"complexity,":[93,105],"extend":[94],"previous":[95],"results":[96],"showing":[97],"provide":[107],"structural":[108],"evidence":[109],"interest":[111],"in":[112,124],"its":[113],"own":[114],"right\u2014namely,":[115],"if":[117],"all":[118],"disjunctively":[120],"self-reducible":[121],"P":[125],"then":[126],"${\\text{FewP}}":[127],"\\cap":[128],"{\\text{FewP}}$":[129],"is":[130,135,174],"not":[131],"P-bi-immune\u2014that":[132],"our":[133],"extension":[134],"unlikely":[136],"extended":[139],"further.":[140],"obtain":[142],"density-based":[143],"sufficient":[144],"conditions":[145],"kernel-constructibility:":[147],"whose":[149],"complements":[150],"captured":[152],"by":[153],"perforce":[157],"constructible.":[159],"Using":[160],"languages":[162],"Kolmogorov":[164],"complexity":[165],"theory":[166],"as":[167],"tools,":[168],"we":[169],"argue":[170],"orthogonal":[175],"standard":[177],"complexity.":[180]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}