{"id":"https://openalex.org/W2007643787","doi":"https://doi.org/10.1137/0209024","title":"Probabilistic Algorithms in Finite Fields","display_name":"Probabilistic Algorithms in Finite Fields","publication_year":1980,"publication_date":"1980-05-01","ids":{"openalex":"https://openalex.org/W2007643787","doi":"https://doi.org/10.1137/0209024","mag":"2007643787"},"language":"en","primary_location":{"id":"doi:10.1137/0209024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209024","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5110849557","display_name":"Michael O. Rabin","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael O. Rabin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110849557"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":45.0539,"has_fulltext":false,"cited_by_count":316,"citation_normalized_percentile":{"value":0.99747458,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"9","issue":"2","first_page":"273","last_page":"280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9976999759674072,"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.9976999759674072,"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/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9825000166893005,"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/finite-field","display_name":"Finite field","score":0.8199783563613892},{"id":"https://openalex.org/keywords/irreducible-polynomial","display_name":"Irreducible polynomial","score":0.7249733209609985},{"id":"https://openalex.org/keywords/factorization-of-polynomials","display_name":"Factorization of polynomials","score":0.6563266515731812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5920443534851074},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.54345703125},{"id":"https://openalex.org/keywords/square-free-polynomial","display_name":"Square-free polynomial","score":0.49855494499206543},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.48633795976638794},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4852133095264435},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.47377467155456543},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4631689488887787},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45976772904396057},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44490674138069153},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.4403994679450989},{"id":"https://openalex.org/keywords/matrix-polynomial","display_name":"Matrix polynomial","score":0.31727051734924316}],"concepts":[{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.8199783563613892},{"id":"https://openalex.org/C165030954","wikidata":"https://www.wikidata.org/wiki/Q1476663","display_name":"Irreducible polynomial","level":4,"score":0.7249733209609985},{"id":"https://openalex.org/C108741685","wikidata":"https://www.wikidata.org/wiki/Q392477","display_name":"Factorization of polynomials","level":4,"score":0.6563266515731812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5920443534851074},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.54345703125},{"id":"https://openalex.org/C101525915","wikidata":"https://www.wikidata.org/wiki/Q7581979","display_name":"Square-free polynomial","level":4,"score":0.49855494499206543},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.48633795976638794},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4852133095264435},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.47377467155456543},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4631689488887787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45976772904396057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44490674138069153},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.4403994679450989},{"id":"https://openalex.org/C101044782","wikidata":"https://www.wikidata.org/wiki/Q6787887","display_name":"Matrix polynomial","level":3,"score":0.31727051734924316},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/0209024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209024","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:ADA078416","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA078416","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.5653","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.5653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TR-213.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1489273657","https://openalex.org/W1907666253","https://openalex.org/W1973452640","https://openalex.org/W2100556391"],"related_works":["https://openalex.org/W1576380577","https://openalex.org/W4249593543","https://openalex.org/W2068749660","https://openalex.org/W4232063670","https://openalex.org/W2288130547","https://openalex.org/W4247961104","https://openalex.org/W2186737732","https://openalex.org/W2321128073","https://openalex.org/W1980267752","https://openalex.org/W1991224576"],"abstract_inverted_index":{"We":[0],"present":[1],"probabilistic":[2],"algorithms":[3,54,80],"for":[4],"the":[5,86,89],"problems":[6,39],"of":[7,12,21,37,41,66,82,88],"finding":[8,19],"an":[9],"irreducible":[10,30],"polynomial":[11,27,90],"degree":[13],"n":[14],"over":[15,32],"a":[16,22,26,33,56],"finite":[17,34,64],"field,":[18],"roots":[20],"polynomial,":[23],"and":[24,50,91],"factoring":[25],"into":[28],"its":[29],"factors":[31],"field.":[35],"All":[36],"these":[38],"are":[40,81],"importance":[42],"in":[43,85,93],"algebraic":[44,47],"coding":[45],"theory,":[46],"symbol":[48],"manipulation,":[49],"number":[51],"theory.":[52],"These":[53],"have":[55],"very":[57],"transparent,":[58],"easy":[59],"to":[60],"program":[61],"structure.":[62],"For":[63],"fields":[65,92],"large":[67],"characteristic":[68],"p,":[69],"so":[70],"that":[71],"exhaustive":[72],"search":[73],"throng":[74],"Zp":[75],"is":[76],"not":[77],"feasible,":[78],"our":[79],"lower":[83],"order":[84],"degrees":[87],"question,":[94],"than":[95],"previously":[96],"published":[97],"algorithms.":[98]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}