{"id":"https://openalex.org/W2079599253","doi":"https://doi.org/10.1145/1088233.1088236","title":"The impact of complexity theory on algorithms for sparse polynomials","display_name":"The impact of complexity theory on algorithms for sparse polynomials","publication_year":1977,"publication_date":"1977-02-01","ids":{"openalex":"https://openalex.org/W2079599253","doi":"https://doi.org/10.1145/1088233.1088236","mag":"2079599253"},"language":"en","primary_location":{"id":"doi:10.1145/1088233.1088236","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1088233.1088236","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1088233.1088236","source":{"id":"https://openalex.org/S4210226623","display_name":"ACM SIGSAM Bulletin","issn_l":"0163-5824","issn":["0163-5824","1557-9492"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGSAM Bulletin","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1088233.1088236","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076478379","display_name":"Kenneth L. Manders","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kenneth L. Manders","raw_affiliation_strings":["University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076478379"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.6138,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.673429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"1","first_page":"8","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9991999864578247,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9991999864578247,"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.9984999895095825,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9973000288009644,"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/algebraic-number","display_name":"Algebraic number","score":0.5529971122741699},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5298815965652466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.523145318031311},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5092185735702515},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.508581280708313},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.4721788465976715},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43822774291038513},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.43546003103256226},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4255313277244568},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42264217138290405},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42095452547073364},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.33470430970191956},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.08983829617500305}],"concepts":[{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5529971122741699},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5298815965652466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.523145318031311},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5092185735702515},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.508581280708313},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.4721788465976715},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43822774291038513},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.43546003103256226},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4255313277244568},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42264217138290405},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42095452547073364},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33470430970191956},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.08983829617500305},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1088233.1088236","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1088233.1088236","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1088233.1088236","source":{"id":"https://openalex.org/S4210226623","display_name":"ACM SIGSAM Bulletin","issn_l":"0163-5824","issn":["0163-5824","1557-9492"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGSAM Bulletin","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/1088233.1088236","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1088233.1088236","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1088233.1088236","source":{"id":"https://openalex.org/S4210226623","display_name":"ACM SIGSAM Bulletin","issn_l":"0163-5824","issn":["0163-5824","1557-9492"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGSAM Bulletin","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7799999713897705,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2079599253.pdf","grobid_xml":"https://content.openalex.org/works/W2079599253.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1964410812","https://openalex.org/W1964766270","https://openalex.org/W1977022731","https://openalex.org/W1997491141","https://openalex.org/W2012140001","https://openalex.org/W2029244876","https://openalex.org/W2036265926","https://openalex.org/W2052936500","https://openalex.org/W2065643335","https://openalex.org/W2071056578","https://openalex.org/W2073067110","https://openalex.org/W2076597612","https://openalex.org/W2126160338","https://openalex.org/W2401610261","https://openalex.org/W3175367423","https://openalex.org/W4212875219"],"related_works":["https://openalex.org/W1970403310","https://openalex.org/W2889493128","https://openalex.org/W1877508920","https://openalex.org/W2885964212","https://openalex.org/W2094091116","https://openalex.org/W922655137","https://openalex.org/W1997399992","https://openalex.org/W2107287896","https://openalex.org/W1989776440","https://openalex.org/W2461843891"],"abstract_inverted_index":{"In":[0],"recent":[1],"work":[2],"[12][13],":[3],"Plaisted":[4],"has":[5],"considered":[6],"the":[7,32,40,43,57,105,115,136,144,161,179],"computational":[8],"complexity":[9,121,182],"of":[10,34,42,117,156,160,170,174],"certain":[11],"decision":[12],"problems":[13],"for":[14,61,114,139],"sparse":[15,70,98],"polynomials.":[16],"The":[17,48],"present":[18],"expository":[19],"paper":[20],"is":[21,54,78,131,178],"intended":[22],"to":[23,28,38,45,51,86,89,103],"make":[24],"these":[25],"results":[26,44],"accessible":[27],"those":[29,124],"working":[30,125],"in":[31,72,143,158,172,181],"area":[33],"algebraic":[35,127,162],"manipulation":[36],"and":[37,123],"clarify":[39],"relevance":[41],"this":[46],"area.":[47],"basic":[49],"insight":[50],"be":[52,87],"gained":[53],"that":[55,76,129],"if":[56],"best":[58],"known":[59],"algorithms":[60,92,148],"a":[62,74,132,153],"problem":[63,109],"concerning":[64],"(not":[65],"necessarily":[66],"sparse)":[67],"polynomials":[68,71],"process":[69],"such":[73],"way":[75],"sparsity":[77],"lost,":[79],"then":[80],"one":[81,101],"should":[82],"not":[83],"expect":[84],"it":[85],"possible":[88],"design":[90],"special":[91],"with":[93],"consistently":[94],"improved":[95,118],"performance":[96],"on":[97,126,184],"polynomials,":[99],"unless":[100],"hopes":[102],"solve":[104],"NP":[106],"=":[107],"P":[108],"positively.":[110],"Also":[111],"we":[112],"note,":[113],"sake":[116],"communication":[119],"between":[120,135],"theorists":[122],"manipulation,":[128],"there":[130],"significant":[133],"difference":[134],"conventions":[137],"used":[138],"expressing":[140],"computation":[141],"time":[142],"two":[145],"areas:":[146],"Many":[147],"which":[149],"always":[150],"run":[151],"within":[152],"polynomial":[154],"number":[155,169],"steps,":[157,171],"terms":[159,173],"parameters":[163],"involved,":[164],"will":[165],"require":[166],"an":[167],"exponential":[168],"input":[175],"length":[176],"(as":[177],"usage":[180],"theory),":[183],"infinitely":[185],"many":[186],"inputs.":[187]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}