Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Amortizing randomness in private multiparty computations
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Modeling design constraints and biasing in simulation using BDDs
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
On restricted min-wise independence of permutations
Random Structures & Algorithms
Balanced families of perfect hash functions and their applications
ACM Transactions on Algorithms (TALG)
Value-ordering heuristics: search performance vs. solution diversity
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Derandomized constructions of k-wise (almost) independent permutations
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Probabilistic existence of rigid combinatorial structures
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Balanced families of perfect hash functions and their applications
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
The subject of this paper is finding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certain limited set of constraints of the form Pr (Event) = $\pi$. It is shown that the problem of deciding whether there exists any distribution satisfying a given set of constraints is NP-hard. However, if the constraints are consistent, then there exists a distribution satisfying them, which is supported by a "small" sample space (one whose cardinality is equal to the number of constraints). For the important case of independence constraints, where the constraints have a certain form and are consistent with a joint distribution of independent random variables, a small sample space can be constructed in polynomial time. This last result can be used to derandomize algorithms; this is demonstrated by an application to the problem of finding large independent sets in sparse hypergraphs.