{"id":"https://openalex.org/W3029800901","doi":"https://doi.org/10.1145/3373718.3394746","title":"Universal equivalence and majority of probabilistic programs over finite fields","display_name":"Universal equivalence and majority of probabilistic programs over finite fields","publication_year":2020,"publication_date":"2020-05-25","ids":{"openalex":"https://openalex.org/W3029800901","doi":"https://doi.org/10.1145/3373718.3394746","mag":"3029800901"},"language":"en","primary_location":{"id":"doi:10.1145/3373718.3394746","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3373718.3394746","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3373718.3394746","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3373718.3394746","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075577852","display_name":"Gilles Barthe","orcid":"https://orcid.org/0000-0002-3853-1777"},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software Institute","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Gilles Barthe","raw_affiliation_strings":["MPI-SP & IMDEA Software Institute","MPI-SP & IMDEA Software Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MPI-SP & IMDEA Software Institute","institution_ids":["https://openalex.org/I4210162154"]},{"raw_affiliation_string":"MPI-SP & IMDEA Software Institute","institution_ids":["https://openalex.org/I4210162154"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057561034","display_name":"Charlie Jacomme","orcid":"https://orcid.org/0009-0003-4465-3150"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Charlie Jacomme","raw_affiliation_strings":["LSV, CNRS & ENS Paris-Saclay & Inria & Universit\u00e9 Paris-Saclay"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LSV, CNRS & ENS Paris-Saclay & Inria & Universit\u00e9 Paris-Saclay","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I277688954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085316790","display_name":"Steve Kremer","orcid":"https://orcid.org/0009-0004-6946-0678"},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Steve Kremer","raw_affiliation_strings":["LORIA, Inria Nancy-Grand Est & CNRS & Universit\u00e9 de Lorraine","LORIA, Inria Nancy-Grand Est & CNRS & Universit\u00e9 de Lorraine"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LORIA, Inria Nancy-Grand Est & CNRS & Universit\u00e9 de Lorraine","institution_ids":["https://openalex.org/I4210121838","https://openalex.org/I90183372"]},{"raw_affiliation_string":"LORIA, Inria Nancy-Grand Est & CNRS & Universit\u00e9 de Lorraine","institution_ids":["https://openalex.org/I4210121838","https://openalex.org/I90183372"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.46,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6347919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10801","issue":null,"first_page":"155","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994000196456909,"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/T10237","display_name":"Cryptography and Data Security","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9947999715805054,"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/decidability","display_name":"Decidability","score":0.7458046674728394},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6763529181480408},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.620370090007782},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5687922239303589},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5475202798843384},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5212441086769104},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4165671467781067},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.41098251938819885},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29607275128364563},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28026920557022095},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.12181344628334045}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7458046674728394},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6763529181480408},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.620370090007782},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5687922239303589},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5475202798843384},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5212441086769104},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4165671467781067},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.41098251938819885},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29607275128364563},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28026920557022095},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.12181344628334045},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3373718.3394746","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3373718.3394746","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3373718.3394746","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02961583v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-02961583","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM/IEEE LICS 2020 - 35th Annual Symposium on Logic in Computer Science, Jul 2020, Saarbr\u00fccken / Virtual, Germany. pp.155-166, ⟨10.1145/3373718.3394746⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"doi:10.1145/3373718.3394746","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3373718.3394746","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3373718.3394746","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.6000000238418579,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G4970457988","display_name":null,"funder_award_id":"N000141512750","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3029800901.pdf","grobid_xml":"https://content.openalex.org/works/W3029800901.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W12758337","https://openalex.org/W42020886","https://openalex.org/W150877817","https://openalex.org/W1714637014","https://openalex.org/W1733262075","https://openalex.org/W1797219784","https://openalex.org/W1972600569","https://openalex.org/W1975784724","https://openalex.org/W1989159237","https://openalex.org/W2014308048","https://openalex.org/W2026258357","https://openalex.org/W2049389441","https://openalex.org/W2054754886","https://openalex.org/W2069788171","https://openalex.org/W2092230546","https://openalex.org/W2142174533","https://openalex.org/W2334612034","https://openalex.org/W2400124473","https://openalex.org/W2498996213","https://openalex.org/W2571169473","https://openalex.org/W3029800901","https://openalex.org/W4247052524"],"related_works":["https://openalex.org/W1865715204","https://openalex.org/W1994637428","https://openalex.org/W2096284940","https://openalex.org/W2916830211","https://openalex.org/W2964662755","https://openalex.org/W2021535402","https://openalex.org/W4232397231","https://openalex.org/W1569124960","https://openalex.org/W2950141706","https://openalex.org/W1965531865"],"abstract_inverted_index":{"We":[0,42],"study":[1,155],"decidability":[2],"problems":[3],"for":[4,9,90,99],"equivalence":[5,69,89,160],"of":[6,18,46,74,93,97,129,158],"probabilistic":[7,12],"programs,":[8],"a":[10,124,163],"core":[11],"programming":[13,22],"language":[14,23],"over":[15,54,70],"finite":[16,56],"fields":[17],"fixed":[19],"characteristic.":[20],"The":[21,76],"supports":[24],"uniform":[25],"sampling,":[26],"addition,":[27],"multiplication":[28],"and":[29,31,39,123,141],"conditionals":[30],"thus":[32],"is":[33,106],"sufficiently":[34],"expressive":[35],"to":[36,87,144,150],"encode":[37],"boolean":[38],"arithmetic":[40],"circuits.":[41],"consider":[43],"two":[44],"variants":[45,157],"equivalence:":[47],"the":[48,55,60,103,117,130,142,159],"first":[49,104],"one":[50,85],"considers":[51],"an":[52],"interpretation":[53],"field":[57],"Fq,":[58],"while":[59],"second":[61],"one,":[62],"which":[63,114],"we":[64,109,133,154,165],"call":[65,166],"universal":[66,77,131],"equivalence,":[67],"verifies":[68],"all":[71],"extensions":[72],"Fqk":[73],"Fq.":[75],"variant":[78,132],"typically":[79],"arises":[80],"in":[81,116],"provable":[82],"cryptography":[83],"when":[84],"wishes":[86],"prove":[88],"any":[91,100],"length":[92],"bitstrings,":[94],"i.e.,":[95],"elements":[96],"F2k":[98],"k.":[101],"While":[102],"problem":[105,164],"obviously":[107],"decidable,":[108],"establish":[110],"its":[111],"exact":[112],"complexity":[113],"lies":[115],"counting":[118],"hierarchy.":[119],"To":[120],"show":[121],"decidability,":[122],"doubly":[125],"exponential":[126],"upper":[127],"bound,":[128],"rely":[134],"on":[135],"results":[136],"from":[137],"algorithmic":[138],"number":[139],"theory":[140],"possibility":[143],"compare":[145],"local":[146],"zeta":[147],"functions":[148],"associated":[149],"given":[151],"polynomials.":[152],"Finally":[153],"several":[156],"problem,":[161],"including":[162],"majority,":[167],"motivated":[168],"by":[169],"differential":[170],"privacy.":[171]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}