{"id":"https://openalex.org/W2055734996","doi":"https://doi.org/10.1137/0212038","title":"Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets","display_name":"Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets","publication_year":1983,"publication_date":"1983-08-01","ids":{"openalex":"https://openalex.org/W2055734996","doi":"https://doi.org/10.1137/0212038","mag":"2055734996"},"language":"en","primary_location":{"id":"doi:10.1137/0212038","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0212038","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/A5058284151","display_name":"Esko Ukkonen","orcid":"https://orcid.org/0000-0002-5978-1505"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Esko Ukkonen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058284151"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5465,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.63522285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"3","first_page":"580","last_page":"587"},"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.9998999834060669,"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.9998999834060669,"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/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9987999796867371,"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/pspace","display_name":"PSPACE","score":0.8771125674247742},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7501713633537292},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6189322471618652},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6145352125167847},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5378341674804688},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4811469316482544},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.46264421939849854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44550952315330505},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43924224376678467},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.4196869730949402},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.35332053899765015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2620985805988312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21314454078674316}],"concepts":[{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.8771125674247742},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7501713633537292},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6189322471618652},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6145352125167847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5378341674804688},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4811469316482544},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.46264421939849854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44550952315330505},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43924224376678467},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.4196869730949402},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35332053899765015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2620985805988312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21314454078674316},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0212038","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0212038","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1519919954","https://openalex.org/W1986203294","https://openalex.org/W1986448430","https://openalex.org/W2007527356","https://openalex.org/W2013455832","https://openalex.org/W2027466944","https://openalex.org/W2045033949","https://openalex.org/W2090186532"],"related_works":["https://openalex.org/W2085484366","https://openalex.org/W1486286946","https://openalex.org/W2122747219","https://openalex.org/W2146459129","https://openalex.org/W2950065312","https://openalex.org/W278676640","https://openalex.org/W2591371812","https://openalex.org/W4302414675","https://openalex.org/W2482914130","https://openalex.org/W2048353152"],"abstract_inverted_index":{"Inspired":[0],"by":[1],"the":[2,6,33,51,106,119],"recent":[3],"solution":[4],"of":[5,35,57,95],"Berman-Hartmanis":[7],"conjecture":[8],"[SIAM":[9],"J.":[10],"Comp.,":[11],"6":[12],"(1977),":[13],"pp.":[14],"305\u2013322]":[15],"that":[16,65,124],"NP":[17,36,67],"cannot":[18],"have":[19],"a":[20,70,93,129],"sparse":[21,130],"complete":[22,43],"set":[23,132],"for":[24,45,102,133],"many-one":[25,52],"reductions":[26,59],"unless":[27],"${\\text{P}}":[28,80,139],"=":[29,81,83,140,142],"{\\text{NP}}$,":[30],"we":[31,63],"analyze":[32],"implications":[34],"and":[37],"PSPACE":[38],"having":[39],"sparse,":[40],"hard":[41,131],"or":[42],"sets":[44],"reduction":[46],"types":[47],"more":[48],"general":[49],"than":[50],"reductions.":[53],"Three":[54],"special":[55],"cases":[56],"truth-table":[58],"are":[60],"considered.":[61],"First":[62],"show":[64,123],"if":[66,125],"(PSPACE)":[68,127],"has":[69,128],"tally":[71],"$":[72,86,91],"\\leqq":[73,87],"_{k":[74,88],"-":[75,89],"T}^P":[76,90],"$-hard":[77],"set,":[78],"then":[79,138],"{\\text{NP}}$$({\\text{P}}":[82,141],"{\\text{PSPACE}})$.":[84,143],"Here":[85],"denotes":[92],"subcase":[94],"polynomial":[96,135],"time":[97,136],"Turing":[98,108],"reducibility":[99],"in":[100],"which,":[101],"some":[103],"constant":[104],"k,":[105],"reducing":[107],"machine":[109],"is":[110],"allowed":[111],"to":[112,118],"make":[113],"at":[114],"most":[115],"k":[116],"queries":[117],"oracle.":[120],"We":[121],"also":[122],"co-NP":[126],"conjunctive":[134],"reductions,":[137]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}