{"id":"https://openalex.org/W2144518319","doi":"https://doi.org/10.1016/0304-3975(95)80032-5","title":"On the cell probe complexity of polynomial evaluation","display_name":"On the cell probe complexity of polynomial evaluation","publication_year":1995,"publication_date":"1995-07-01","ids":{"openalex":"https://openalex.org/W2144518319","doi":"https://doi.org/10.1016/0304-3975(95)80032-5","mag":"2144518319"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(95)80032-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)80032-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/0304397595800325/pdf","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":true,"oa_status":"hybrid","oa_url":"https://www.sciencedirect.com/science/article/pii/0304397595800325/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006968747","display_name":"Peter Bro Miltersen","orcid":null},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Peter Bro Miltersen","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK","Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]},{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK#TAB#","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006968747"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":{"value":2600,"currency":"USD","value_usd":2600},"fwci":1.0573,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.78222509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"143","issue":"1","first_page":"167","last_page":"174"},"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.9948999881744385,"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.9948999881744385,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9799000024795532,"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/T11269","display_name":"Algorithms and Data Compression","score":0.977400004863739,"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/finite-field","display_name":"Finite field","score":0.6455123424530029},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6441680192947388},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6368272304534912},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6248027086257935},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5811895728111267},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5430360436439514},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5160176753997803},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5104984045028687},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4942529499530792},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.48410046100616455},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.42899176478385925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33282458782196045},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2666010856628418},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1925291121006012},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06272715330123901},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06179213523864746},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05375513434410095}],"concepts":[{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.6455123424530029},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6441680192947388},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6368272304534912},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6248027086257935},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5811895728111267},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5430360436439514},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5160176753997803},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5104984045028687},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4942529499530792},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.48410046100616455},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.42899176478385925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33282458782196045},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2666010856628418},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1925291121006012},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06272715330123901},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06179213523864746},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05375513434410095},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/0304-3975(95)80032-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)80032-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/0304397595800325/pdf","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"},{"id":"pmh:oai:wrap.warwick.ac.uk:60946","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Report"},{"id":"pmh:hdl:10068/652427","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/652427","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"R - Report"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.8597","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.8597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.daimi.au.dk/~bromille/Papers/./cpcpe.ps","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/683b9ac0-b1c3-11df-8c1a-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/683b9ac0-b1c3-11df-8c1a-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Miltersen, P B 1995, 'On the cell probe complexity of polynomial evaluation', Theoretical Computer Science, vol. 143, no. 1, pp. 167-174. https://doi.org/10.1016/0304-3975(95)80032-5","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/0304-3975(95)80032-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(95)80032-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/0304397595800325/pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2144518319.pdf","grobid_xml":"https://content.openalex.org/works/W2144518319.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1534828715","https://openalex.org/W1985177045","https://openalex.org/W1993022201","https://openalex.org/W2007683581","https://openalex.org/W2020013154","https://openalex.org/W2050108834","https://openalex.org/W2061496873","https://openalex.org/W2078423836","https://openalex.org/W2089620427","https://openalex.org/W2165621523","https://openalex.org/W3021014091","https://openalex.org/W6632041246"],"related_works":["https://openalex.org/W2990853482","https://openalex.org/W2327776271","https://openalex.org/W2374430960","https://openalex.org/W2041069649","https://openalex.org/W2047754121","https://openalex.org/W2461808546","https://openalex.org/W2045590835","https://openalex.org/W2953001340","https://openalex.org/W342214647","https://openalex.org/W1589381382"],"abstract_inverted_index":{"We":[0,27],"consider":[1],"the":[2,7,30,36,57],"cell":[3,32],"probe":[4,33],"complexity":[5],"of":[6,13,17,56],"polynomial":[8],"evaluation":[9],"problem":[10,37],"with":[11],"preprocessing":[12],"coefficients,":[14],"for":[15,35],"polynomials":[16],"degree":[18],"at":[19],"most":[20],"n":[21],"over":[22],"a":[23,53],"finite":[24],"field":[25],"K.":[26],"show":[28],"that":[29,59],"trivial":[31],"algorithm":[34],"is":[38,42],"optimal":[39],"if":[40],"K":[41],"sufficiently":[43],"large":[44],"compared":[45],"to":[46],"n.":[47],"As":[48],"an":[49],"application,":[50],"we":[51],"give":[52],"new":[54],"proof":[55],"fact":[58],"P":[60],"\u2260":[61],"incr-TIME(o(logn/log":[62],"logn)).":[63]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}