{"id":"https://openalex.org/W2385562929","doi":"https://doi.org/10.1145/2898440","title":"Structural Properties of Nonautoreducible Sets","display_name":"Structural Properties of Nonautoreducible Sets","publication_year":2016,"publication_date":"2016-05-11","ids":{"openalex":"https://openalex.org/W2385562929","doi":"https://doi.org/10.1145/2898440","mag":"2385562929"},"language":"en","primary_location":{"id":"doi:10.1145/2898440","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2898440","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","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/A5100690911","display_name":"Dung T. Nguyen","orcid":"https://orcid.org/0000-0003-1384-8767"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dung Nguyen","raw_affiliation_strings":["LogicBlox Inc"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LogicBlox Inc","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051370311","display_name":"Alan L. Selman","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan L. Selman","raw_affiliation_strings":["University at Buffalo, Buffalo, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University at Buffalo, Buffalo, NY","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3605,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.662956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"8","issue":"3","first_page":"1","last_page":"24"},"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.9994999766349792,"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.9994999766349792,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976999759674072,"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.9973000288009644,"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/mathematics","display_name":"Mathematics","score":0.8640360832214355},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7954064607620239},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5466291904449463},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4788391590118408},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4710393249988556},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46603769063949585},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4307573437690735}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8640360832214355},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7954064607620239},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5466291904449463},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4788391590118408},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4710393249988556},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46603769063949585},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4307573437690735},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2898440","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2898440","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1490686376","https://openalex.org/W1597904065","https://openalex.org/W1972216634","https://openalex.org/W1975715978","https://openalex.org/W1986203294","https://openalex.org/W2030692444","https://openalex.org/W2090154710","https://openalex.org/W2096816637","https://openalex.org/W2106436148","https://openalex.org/W2169625092","https://openalex.org/W2171353564","https://openalex.org/W2258051301","https://openalex.org/W2283269415","https://openalex.org/W2561675875","https://openalex.org/W4250293552"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W4288278856","https://openalex.org/W2572370460","https://openalex.org/W1976691234"],"abstract_inverted_index":{"We":[0,31],"investigate":[1],"autoreducibility":[2],"properties":[3],"of":[4,103,163],"complete":[5,23],"sets":[6,24],"for":[7,25,61,84,134,171],"NEXP":[8,26,62,85,135,172],"under":[9,16,90,140],"different":[10],"polynomial-time":[11,18],"reductions.":[12],"Specifically,":[13],"we":[14,157],"show":[15,158],"some":[17],"reductions":[19,92],"that":[20,27,45,63,86,93,101,136,159],"there":[21,53,76,126],"are":[22,28],"not":[29,65,88,138,149],"autoreducible.":[30],"obtain":[32],"the":[33,161,188],"following":[34],"main":[35],"results:":[36],"\u2014For":[37,70,120],"any":[38,121],"positive":[39,122],"integers":[40],"s":[41,47],"and":[42,111],"k":[43,51,124],"such":[44,100],"2":[46],"\u2212":[48],"1":[49],">":[50,74],",":[52,114,125],"is":[54,64,77,87,117,127,137,148,173],"a":[55,78,106,128,150,153],"\u2264":[56,66,79,129,141,166,174],"s-T":[57],"p":[58,68,81,131,143,168,176],"-complete":[59,82,132,169],"set":[60,83,133,170],"k-tt":[67,130,142],"-autoreducible.":[69],"every":[71,165],"constant":[72],"c":[73,113],"1,":[75],"2-T":[80],"autoreducible":[89,139],"nonadaptive":[91],"make":[94],"no":[95],"more":[96],"than":[97],"three":[98],"queries,":[99],"each":[102],"them":[104],"has":[105],"length":[107],"between":[108],"n":[109,112,116],"1/c":[110],"where":[115],"input":[118],"size.":[119],"integer":[123],"-reductions":[144],"whose":[145],"truth":[146],"table":[147],"disjunction":[151],"or":[152,180],"negated":[154],"disjunction.":[155],"Finally,":[156],"settling":[160],"question":[162],"whether":[164],"dtt":[167],"NOR-tt":[175],"-autoreducible":[177],"either":[178],"positively":[179],"negatively":[181],"would":[182],"lead":[183],"to":[184],"major":[185],"results":[186],"about":[187],"exponential":[189],"time":[190],"complexity":[191],"classes.":[192]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}