{"id":"https://openalex.org/W1565875822","doi":"https://doi.org/10.1007/3-540-16486-3_85","title":"The complexity of sparse sets in P","display_name":"The complexity of sparse sets in P","publication_year":1986,"publication_date":"1986-01-01","ids":{"openalex":"https://openalex.org/W1565875822","doi":"https://doi.org/10.1007/3-540-16486-3_85","mag":"1565875822"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-16486-3_85","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-16486-3_85","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5078734824","display_name":"Eric Allender","orcid":"https://orcid.org/0000-0002-0650-028X"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eric W. Allender","raw_affiliation_strings":["Department of Computer Science, Rutgers University, 08903, New Brunswick, N.J., USA","Rutgers, University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, 08903, New Brunswick, N.J., USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers, University","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078734824"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.3892,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.94837476,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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/T11567","display_name":"semigroups and automata theory","score":0.9965000152587891,"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/set","display_name":"Set (abstract data type)","score":0.6356543302536011},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6159023642539978},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5493462085723877},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5286189913749695},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5213188529014587},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5140324831008911},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.499072790145874},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4831075668334961},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4697813093662262},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45152607560157776},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44775763154029846},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4381188154220581},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.43501484394073486},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4028460681438446},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.40131908655166626},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33870869874954224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29842305183410645},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13755440711975098}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6356543302536011},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6159023642539978},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5493462085723877},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5286189913749695},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5213188529014587},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5140324831008911},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.499072790145874},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4831075668334961},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4697813093662262},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45152607560157776},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44775763154029846},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4381188154220581},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.43501484394073486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4028460681438446},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.40131908655166626},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33870869874954224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29842305183410645},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13755440711975098},{"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/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-16486-3_85","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-16486-3_85","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:alma.01RUT_INST:11663508540004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/bookChapter/The-complexity-of-sparse-sets-in/991031654631704646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"Open Research (University of Surrey)","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Book Section"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W12028039","https://openalex.org/W18458235","https://openalex.org/W421997344","https://openalex.org/W1488487350","https://openalex.org/W1530594172","https://openalex.org/W1552748144","https://openalex.org/W1593443957","https://openalex.org/W1834795791","https://openalex.org/W1949885173","https://openalex.org/W1995893260","https://openalex.org/W2002089154","https://openalex.org/W2003519998","https://openalex.org/W2009556743","https://openalex.org/W2020164082","https://openalex.org/W2027501230","https://openalex.org/W2033229895","https://openalex.org/W2044504659","https://openalex.org/W2053392269","https://openalex.org/W2061746118","https://openalex.org/W2069348040","https://openalex.org/W2073879013","https://openalex.org/W2079275582","https://openalex.org/W2093998359","https://openalex.org/W2130130502","https://openalex.org/W2159841662","https://openalex.org/W2296295759"],"related_works":["https://openalex.org/W2122747219","https://openalex.org/W1981385397","https://openalex.org/W1486286946","https://openalex.org/W1523547988","https://openalex.org/W2051933114","https://openalex.org/W2144557478","https://openalex.org/W1483438220","https://openalex.org/W2109807377","https://openalex.org/W2415632638","https://openalex.org/W1993180032"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}