Charlie Jacomme
Charlie Jacomme
Home
Open Positions
Teaching
Non Academic Materials
Contact
Light
Dark
Automatic
finite fields
Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
We study decidability problems for equivalence of probabilistic programs for a core probabilistic programming language over finite fields of fixed characteristic. The programming language supports uniform sampling, addition, multiplication, and …
Cite
×