Generation of all randomizations using circuits
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7650416
- Pseudorandom generators, typically-correct derandomization, and circuit lower bounds
- Pseudo-random generators for all hardnesses
- scientific article; zbMATH DE number 1372652
- On the depth of randomly generated circuits
- Outputs in random f-ary recursive circuits
- Toward a universal random number generator
- Pseudorandom bits for constant depth circuits
- Pseudorandomness and Combinatorial Constructions
Cites work
- scientific article; zbMATH DE number 6486637 (Why is no real title available?)
- scientific article; zbMATH DE number 3612277 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- A minimax approach to randomization and estimation in survey sampling
- Algebraic algorithms for sampling from conditional distributions
- Bases for permutation groups and matroids
- Circuits for robust designs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Experimental design issues in big data: the question of bias
- Minimax Purposive Survey Sampling Design
- Minimax designs for sample surveys
- On matroids on edge sets of graphs with connected subgraphs as circuits. II
- Principles of experimental design for big data analysis
- The use of random allocation for the control of selection bias
- Valid randomization
This page was built for publication: Generation of all randomizations using circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173732)