{"id":"https://openalex.org/W2005722951","doi":null,"title":"Self-testing polynomial functions efficiently and over rational domains","display_name":"Self-testing polynomial functions efficiently and over rational domains","publication_year":1992,"publication_date":"1992-09-01","ids":{"openalex":"https://openalex.org/W2005722951","mag":"2005722951"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.176.6618","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.176.6618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/madhu/papers/1992/rs-soda.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5041567023","display_name":"Ronitt Rubinfeld","orcid":"https://orcid.org/0000-0002-4353-7639","observed_orcids":["https://orcid.org/0000-0002-4353-7639"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ronitt Rubinfeld","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489","observed_orcids":["https://orcid.org/0000-0003-3718-6489","https://orcid.org/0009-0005-6560-9663","https://orcid.org/0000-0001-7713-7003","https://orcid.org/0000-0002-8110-9205"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Madhu Sudan","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3718-6489","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2316,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.94551845,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"32"},"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.6791999936103821,"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.6791999936103821,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.20520000159740448,"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/T11130","display_name":"Coding theory and cryptography","score":0.02889999933540821,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/self-testing","display_name":"self-testing","score":0.6629999876022339},{"id":"https://openalex.org/keywords/polynomials","display_name":"polynomials","score":0.6589999794960022},{"id":"https://openalex.org/keywords/finite-fields","display_name":"finite fields","score":0.9490000009536743},{"id":"https://openalex.org/keywords/algorithmic-efficiency","display_name":"algorithm efficiency","score":0.5299999713897705}],"concepts":[{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.6799242496490479},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6408698558807373},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6215602159500122},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6127238869667053},{"id":"https://openalex.org/C75190567","wikidata":"https://www.wikidata.org/wiki/Q41237","display_name":"Rational function","level":2,"score":0.5972551107406616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4633311331272125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42268431186676025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4214860200881958},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38664132356643677},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3612058758735657},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.19846513867378235},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.176.6618","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.176.6618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/madhu/papers/1992/rs-soda.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.6667","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.6667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.lcs.mit.edu/~madhu/papers/rs-soda.ps","raw_type":"text"},{"id":"mag:2005722951","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda92.html#RubinfeldS92","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1501278571","https://openalex.org/W1594335079","https://openalex.org/W1596412683","https://openalex.org/W2033361557","https://openalex.org/W2094878497","https://openalex.org/W2097206148","https://openalex.org/W2134839489","https://openalex.org/W2141815340"],"related_works":["https://openalex.org/W1487800348","https://openalex.org/W2788979572","https://openalex.org/W2094878497","https://openalex.org/W2153598659","https://openalex.org/W150546327","https://openalex.org/W7097756226","https://openalex.org/W3022848472","https://openalex.org/W2041903445","https://openalex.org/W2913094706","https://openalex.org/W1498798784"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,54],"give":[4],"the":[5,24,31,91,104,155],"first":[6],"self-testers":[7],"and":[8,14,106,125,145],"checkers":[9],"for":[10,33,77,112],"polynomials":[11,35],"over":[12,36],"rational":[13],"integer":[15],"domains.":[16],"We":[17],"also":[18],"show":[19],"significantly":[20],"stronger":[21],"bounds":[22],"on":[23,86,122,132],"efficiency":[25],"of":[26,30,93,163],"a":[27,58,63,74,107,115,143],"simple":[28],"modification":[29],"algorithm":[32],"self-testing":[34,75],"finite":[37],"fields":[38],"given":[39],"in":[40,146,169],"[8].":[41],"1":[42],"Introduction":[43],"Suppose":[44],"someone":[45],"gives":[46],"us":[47],"an":[48,161],"extremely":[49],"fast":[50],"program":[51,76,82,95,109,116,164],"P":[52,71,83,117,140],"that":[53,70,81,96,102,119],"can":[55],"call":[56],"as":[57,98,100,142,167],"black":[59],"box":[60],"to":[61,128,153],"compute":[62,129,154],"function":[64,156],"f":[65,78,113,130,157],".":[66,158],"Rather":[67],"than":[68],"trust":[69],"works":[72],"correctly,":[73],"([5])":[79],"verifies":[80],"is":[84,97,120,160],"correct":[85,121],"most":[87,123],"inputs":[88],"(without":[89],"assuming":[90],"correctness":[92],"another":[94],"difficult":[99],"one":[101],"computes":[103],"function),":[105],"self-correcting":[108],"([5]":[110],"[9])":[111],"takes":[114],",":[118],"inputs,":[124],"uses":[126],"it":[127],"correctly":[131],"every":[133],"input":[134],"(with":[135],"high":[136],"probability).":[137],"Both":[138],"access":[139],"only":[141],"black-box":[144],"some":[147],"precise":[148],"way":[149],"are":[150],"not":[151],"allowed":[152],"Self-testing/correcting":[159],"extension":[162],"result":[165],"checking":[166],"defined":[168],"[3],...":[170]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3}],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2016-06-24T00:00:00"}