The complexity of verifying loop-free programs as differentially private (Q6842441)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 8174033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of verifying loop-free programs as differentially private |
scientific article; zbMATH DE number 8174033 |
Statements
The complexity of verifying loop-free programs as differentially private (English)
0 references
18 March 2026
0 references
differential privacy
0 references
program verification
0 references
probabilistic programs
0 references
