Constraints Daphne Koller e-mail: Nimrod Megiddo y...  Home/Search
Context
Related
| stanford.edu/%7Emegiddo/pd...stoc93.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/~megiddo/bio (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Abstract. 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(E)=. We show 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... (Update)
Similar documents (at the sentence level):
40.0%: Constructing Small Sample Spaces Satisfying Given Constraints - Koller, Megiddo (1993) (Correct)
Active bibliography (related documents): More All
0.0: Unbiased Bits from Sources of Weak Randomness and.. - Chor, Goldreich (1988) (Correct)
0.0: On The Power Of Two-Points Based Sampling - Chor, Goldreich (1989) (Correct)
0.0: On the Power of Additive Combinatorial Search Model - Grebinski (1998) (Correct)
Similar documents based on text: More All
0.5: Fast Algorithms for Finding Randomized Strategies in Game.. - Koller, Megiddo, von.. (1994) (Correct)
0.5: Efficient Computation of Equilibria for Extensive.. - Koller, Megiddo, von.. (1996) (Correct)
0.4: Finding Mixed Strategies with Small Supports in Extensive Form .. - Koller, Megiddo (1995) (Correct)
BibTeX entry: (Update)
@inproceedings{ koller93constructing,
author = "Daphne Koller and Nimrod Megiddo",
title = "Constructing small sample spaces satisfying given constraints",
pages = "268--277",
year = "1993",
url = "citeseer.ist.psu.edu/645224.html" }
Citations (may not include all citations):128 Simple constructions of almost k-wise independentrandomv ari.. - Alon, Goldreich et al. - 1990
102 A fast and simple randomized parallel algorithm for the maxi.. (context) - Alon, Babai et al. - 1986
70 Two theorems on random polynomial time (context) - Adleman - 1978
25 Private communication (context) - Alon
Documents on the same site (http://theory.stanford.edu/~megiddo/bio.html): More
Efficient Computation of Equilibria for Extensive.. - Koller, Megiddo, von.. (1995) (Correct)
A Note on Total Functions, Existence Theorems, and.. - Megiddo, Papadimitriou (1989) (Correct)
Tight Bounds and 2-Approximation Algorithms for.. - Hochbaum, Megiddo.. (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC