Universal equivalence and majority of probabilistic programs over finite fields

DOI10.1145/3373718.3394746zbMath1496.68186OpenAlexW3216210238MaRDI QIDQ5145628

Gilles Barthe, Charlie Jacomme, Steve Kremer

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-02961583/document

zbMATH Keywords

complexityfinite fieldsdecidabilityprogram equivalenceprobabilistic programs

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Privacy of data (68P27)

Related Items (1)

Computing zeta functions of large polynomial systems over finite fields

This page was built for publication: Universal equivalence and majority of probabilistic programs over finite fields