{"id":"https://openalex.org/W2031046967","doi":"https://doi.org/10.1016/0304-3975(84)90130-0","title":"New NP-hard and NP-complete polynomial and integer divisibility problems","display_name":"New NP-hard and NP-complete polynomial and integer divisibility problems","publication_year":1984,"publication_date":"1984-01-01","ids":{"openalex":"https://openalex.org/W2031046967","doi":"https://doi.org/10.1016/0304-3975(84)90130-0","mag":"2031046967"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(84)90130-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(84)90130-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical 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/A5113505964","display_name":"David A. Plaisted","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David A. Plaisted","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, U.S.A","Department of Computer Science, University of Illinois at Urbana\u2010Champaign, Urbana, IL 61801, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, U.S.A","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana\u2010Champaign, Urbana, IL 61801, U.S.A","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113505964"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":3.0573,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.91929853,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"31","issue":"1-2","first_page":"125","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9970999956130981,"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/divisibility-rule","display_name":"Divisibility rule","score":0.8999282121658325},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8046833872795105},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.571998655796051},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42818087339401245},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42377448081970215}],"concepts":[{"id":"https://openalex.org/C9991821","wikidata":"https://www.wikidata.org/wiki/Q858520","display_name":"Divisibility rule","level":2,"score":0.8999282121658325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8046833872795105},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.571998655796051},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42818087339401245},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42377448081970215},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(84)90130-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(84)90130-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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":16,"referenced_works":["https://openalex.org/W1548377147","https://openalex.org/W1964410812","https://openalex.org/W1977022731","https://openalex.org/W2011039300","https://openalex.org/W2029244876","https://openalex.org/W2031740555","https://openalex.org/W2045664183","https://openalex.org/W2046486378","https://openalex.org/W2401610261","https://openalex.org/W3010207593","https://openalex.org/W6632939245","https://openalex.org/W6641434212","https://openalex.org/W6644040475","https://openalex.org/W6658619674","https://openalex.org/W6662012385","https://openalex.org/W6834379202"],"related_works":["https://openalex.org/W2014175480","https://openalex.org/W1036096233","https://openalex.org/W64298394","https://openalex.org/W4367549511","https://openalex.org/W2907189760","https://openalex.org/W2982361184","https://openalex.org/W2009615080","https://openalex.org/W2041496871","https://openalex.org/W2426809472","https://openalex.org/W2003748257"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}