Binary decompositions of probability densities and random-bit simulation (Q777909): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Randomness complexity of private computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid methods in simulation and random variate generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected bit complexity of the von Neumann rejection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling from discrete Gaussians for lattice-based cryptography on a constrained device / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generating an exponentially distributed variate / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distributions Computable by Random Walks on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of binary floating point pseudorandom generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High Precision Discrete Gaussian Sampling on FPGAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum and classical tradeoffs / rank
 
Normal rank

Revision as of 01:15, 23 July 2024

scientific article
Language Label Description Also known as
English
Binary decompositions of probability densities and random-bit simulation
scientific article

    Statements

    Identifiers