{"id":"https://openalex.org/W2033152671","doi":"https://doi.org/10.1142/s0129054195000214","title":"NONDETERMINISTICALLY SELECTIVE SETS","display_name":"NONDETERMINISTICALLY SELECTIVE SETS","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W2033152671","doi":"https://doi.org/10.1142/s0129054195000214","mag":"2033152671"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054195000214","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054195000214","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":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":true,"raw_author_name":"LANE A. HEMASPAANDRA","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051208362","display_name":"Albrecht Hoene","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"ALBRECHT HOENE","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109299269","display_name":"Ashish V. Naik","orcid":"https://orcid.org/0000-0003-0546-5977"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"ASHISH V. NAIK","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019383096","display_name":"Mitsunori Ogihara","orcid":"https://orcid.org/0000-0002-5690-7854"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MITSUNORI OGIHARA","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051370311","display_name":"Alan L. Selman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"ALAN L. SELMAN","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029341628","display_name":"Thomas Thierauf","orcid":"https://orcid.org/0000-0002-2962-594X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"THOMAS THIERAUF","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100439997","display_name":"Jie Wang","orcid":"https://orcid.org/0000-0001-6559-8769"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"JIE WANG","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5088546793"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0696,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.75892514,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"06","issue":"04","first_page":"403","last_page":"416"},"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.9882000088691711,"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.9882000088691711,"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.9556000232696533,"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/T10237","display_name":"Cryptography and Data Security","score":0.9487000107765198,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7767716646194458},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.67341548204422},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4759792387485504},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4693261981010437},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45565155148506165},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4242256283760071},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3735215961933136},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.241445392370224},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07643064856529236}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7767716646194458},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.67341548204422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4759792387485504},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4693261981010437},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45565155148506165},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4242256283760071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3735215961933136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.241445392370224},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07643064856529236},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1142/s0129054195000214","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054195000214","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:CiteSeerX.psu:10.1.1.25.2858","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.2858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theorie.informatik.uni-ulm.de/papers/../Personen/Thierauf/Papers/selectivity.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.7876","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.7876","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rochester.edu/u/ogihara/research/CCC/non-sel.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.505","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uchicago.edu/~naik/papers/ndselec.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3162204513","https://openalex.org/W2371138613","https://openalex.org/W2048963458","https://openalex.org/W43109613","https://openalex.org/W2359952343","https://openalex.org/W2080152487","https://openalex.org/W2239445980","https://openalex.org/W2995553446","https://openalex.org/W2120455979","https://openalex.org/W3022347918"],"abstract_inverted_index":{"In":[0],"this":[1,78],"note,":[2],"we":[3,80],"study":[4,42],"NP-selective":[5,32,46],"sets":[6,8,33,47],"(formally,":[7],"that":[9,94],"are":[10],"selective":[11],"via":[12,65],"NPSV":[13],"t":[14],"functions)":[15],"as":[16,49],"a":[17,66,82],"natural":[18],"generalization":[19],"of":[20,31,38,45,62,74,84],"P-selective":[21,39,75],"sets.":[22,40,76],"We":[23,41,59],"show":[24,93],"that,":[25],"assuming":[26],"P\u2260NP\u2229coNP":[27],",":[28],"the":[29,36,71,95],"class":[30,37],"properly":[34],"contains":[35],"several":[43],"properties":[44,73],"such":[48],"self-reducibility,":[50],"hardness":[51],"under":[52],"various":[53],"reductions,":[54],"lowness,":[55],"and":[56,86,92,113],"nonuniform":[57,118],"complexity.":[58],"prove":[60],"many":[61],"our":[63],"results":[64],"\u201crelativization":[67],"technique,\u201d":[68],"by":[69],"using":[70],"known":[72],"Using":[77],"technique,":[79],"strengthen":[81],"result":[83,96,116],"Longpr\u00e9":[85],"Selman":[87],"on":[88,117],"hard":[89],"promise":[90],"problems":[91],"\u201c":[97],"NP":[98,100,107],"\u2286(":[99],"\u2229":[101],"coNP":[102],")/":[103],"poly":[104],"\u21d2":[105],"PH=NP":[106],"\u201d":[108],"is":[109],"implicit":[110],"in":[111],"Karp":[112],"Lipton\u2019s":[114],"seminal":[115],"classes.":[119]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
