{"id":"https://openalex.org/W4383221822","doi":"https://doi.org/10.1145/3597066.3597108","title":"New Characterization of the Factor Refinement Algorithm with Applications","display_name":"New Characterization of the Factor Refinement Algorithm with Applications","publication_year":2023,"publication_date":"2023-07-05","ids":{"openalex":"https://openalex.org/W4383221822","doi":"https://doi.org/10.1145/3597066.3597108"},"language":"en","primary_location":{"id":"doi:10.1145/3597066.3597108","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597066.3597108","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597066.3597108","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3597066.3597108","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008674767","display_name":"A. Ravi","orcid":"https://orcid.org/0009-0002-7231-8758"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aditya Ravi","raw_affiliation_strings":["University of Michigan, USA"],"raw_orcid":"https://orcid.org/0009-0002-7231-8758","affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073965203","display_name":"Ilya Volkovich","orcid":"https://orcid.org/0000-0002-7616-0751"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ilya Volkovich","raw_affiliation_strings":["Boston College, USA"],"raw_orcid":"https://orcid.org/0000-0002-7616-0751","affiliations":[{"raw_affiliation_string":"Boston College, USA","institution_ids":["https://openalex.org/I103531236"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008674767"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07031965,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"490","last_page":"497"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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/T11567","display_name":"semigroups and automata theory","score":0.9983999729156494,"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/multiplicative-function","display_name":"Multiplicative function","score":0.7747543454170227},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.678617000579834},{"id":"https://openalex.org/keywords/eulers-totient-function","display_name":"Euler's totient function","score":0.5941389799118042},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5445963144302368},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5430315732955933},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5392623543739319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.533748984336853},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5131538510322571},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4293464422225952},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41202688217163086},{"id":"https://openalex.org/keywords/eulers-formula","display_name":"Euler's formula","score":0.37091320753097534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35741549730300903},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35591089725494385}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.7747543454170227},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.678617000579834},{"id":"https://openalex.org/C198944804","wikidata":"https://www.wikidata.org/wiki/Q190026","display_name":"Euler's totient function","level":3,"score":0.5941389799118042},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5445963144302368},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5430315732955933},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5392623543739319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.533748984336853},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5131538510322571},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4293464422225952},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41202688217163086},{"id":"https://openalex.org/C62884695","wikidata":"https://www.wikidata.org/wiki/Q184871","display_name":"Euler's formula","level":2,"score":0.37091320753097534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35741549730300903},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35591089725494385},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3597066.3597108","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597066.3597108","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597066.3597108","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3597066.3597108","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3597066.3597108","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3597066.3597108","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4383221822.pdf"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W185106141","https://openalex.org/W1980291956","https://openalex.org/W1982647225","https://openalex.org/W1991495399","https://openalex.org/W2012857639","https://openalex.org/W2082542492","https://openalex.org/W2091875737","https://openalex.org/W2095280521","https://openalex.org/W2095496644","https://openalex.org/W2117370345","https://openalex.org/W2137521902","https://openalex.org/W2731698263","https://openalex.org/W2914507133","https://openalex.org/W3036807934"],"related_works":["https://openalex.org/W2022386055","https://openalex.org/W2610938918","https://openalex.org/W4250406566","https://openalex.org/W1513265950","https://openalex.org/W2901498436","https://openalex.org/W3135113347","https://openalex.org/W2990163497","https://openalex.org/W4390575969","https://openalex.org/W2963581348","https://openalex.org/W3036985139"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,32,52],"new,":[3],"simple":[4],"characterization":[5,21],"of":[6,9,40,54],"the":[7,10,37],"output":[8],"Factor":[11],"Refinement":[12],"Algorithm,":[13],"formally":[14],"introduced":[15],"and":[16,50],"analyzed":[17],"in":[18],"[3].":[19],"Our":[20],"relies":[22],"only":[23],"on":[24],"basic":[25],"linear":[26],"algebra.":[27],"As":[28],"applications,":[29],"we":[30],"obtain":[31],"non-adaptive":[33],"algorithm":[34],"that":[35],"computes":[36],"square-free":[38],"part":[39],"an":[41],"integer,":[42],"given":[43],"oracle":[44],"access":[45],"to":[46,61],"Euler\u2019s":[47],"Totient":[48],"function,":[49],"identify":[51],"class":[53],"multiplicative":[55],"functions":[56],"which":[57],"is":[58],"polynomial-time":[59],"equivalent":[60],"computing":[62],"radicals.":[63]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}