{"id":"https://openalex.org/W2081323336","doi":"https://doi.org/10.1016/s1571-0661(04)80537-1","title":"On sparseness and Turing reducibility over the reals","display_name":"On sparseness and Turing reducibility over the reals","publication_year":2002,"publication_date":"2002-10-01","ids":{"openalex":"https://openalex.org/W2081323336","doi":"https://doi.org/10.1016/s1571-0661(04)80537-1","mag":"2081323336"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80537-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80537-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80537-1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079608792","display_name":"Felipe Cucker","orcid":"https://orcid.org/0000-0002-4569-3248"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Felipe Cucker","raw_affiliation_strings":["Dept. of Mathematics, City University of Hong Kong, Hong Kong, Peoples Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics, City University of Hong Kong, Hong Kong, Peoples Republic of China","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079608792"],"corresponding_institution_ids":["https://openalex.org/I168719708"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15369223,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"67","issue":null,"first_page":"7","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9987000226974487,"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/description-number","display_name":"Description number","score":0.614452064037323},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.6012840270996094},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5739670991897583},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5110851526260376},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.4898664653301239},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46542996168136597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4367027282714844},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40504008531570435},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.333548367023468},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3159191906452179},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.2724693715572357},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07187032699584961},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.06104579567909241}],"concepts":[{"id":"https://openalex.org/C179061269","wikidata":"https://www.wikidata.org/wiki/Q5263786","display_name":"Description number","level":5,"score":0.614452064037323},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.6012840270996094},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5739670991897583},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5110851526260376},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.4898664653301239},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46542996168136597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4367027282714844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40504008531570435},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.333548367023468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3159191906452179},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.2724693715572357},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07187032699584961},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.06104579567909241}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(04)80537-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80537-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/73d2f4c9-e226-4549-952f-a7af8cd618bc","is_oa":true,"landing_page_url":"https://hdl.handle.net/2031/73d2f4c9-e226-4549-952f-a7af8cd618bc","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cucker, F 2002, 'On sparseness and Turing reducibility over the reals', Electronic Notes in Theoretical Computer Science, vol. 67, pp. 9-16. https://doi.org/10.1016/S1571-0661(04)80537-1","raw_type":"info:eu-repo/semantics/other"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80537-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80537-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W26023427","https://openalex.org/W636105900","https://openalex.org/W1485087398","https://openalex.org/W1550331971","https://openalex.org/W1976838138","https://openalex.org/W1986662193","https://openalex.org/W1996195522","https://openalex.org/W2017816090","https://openalex.org/W2023336906","https://openalex.org/W2030220007","https://openalex.org/W2033206092","https://openalex.org/W2071846104","https://openalex.org/W2090186532","https://openalex.org/W2093614095","https://openalex.org/W2106637336","https://openalex.org/W2159504006","https://openalex.org/W2314912482","https://openalex.org/W6675869016","https://openalex.org/W6699528252"],"related_works":["https://openalex.org/W2273345230","https://openalex.org/W4324016496","https://openalex.org/W1559604976","https://openalex.org/W4231495498","https://openalex.org/W2119244842","https://openalex.org/W4285436350","https://openalex.org/W192442233","https://openalex.org/W1969470083","https://openalex.org/W2963860960","https://openalex.org/W2571692953"],"abstract_inverted_index":{"We":[0],"prove":[1],"some":[2],"results":[3],"about":[4],"existence":[5],"of":[6],"NP-complete":[7],"and":[8],"NP-hard":[9],"(for":[10],"Turing":[11],"reductions)":[12],"sparse":[13],"sets":[14],"on":[15],"different":[16],"settings":[17],"over":[18],"the":[19],"real":[20],"numbers.":[21]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}