Pages that link to "Item:Q1079379"

The following pages link to Random generation of combinatorial structures from a uniform distribution (Q1079379):

Displaying 50 items.

• The complexity of estimating min-entropy (Q260395) (← links)
• On computing minimal independent support and its applications to sampling and counting (Q265701) (← links)
• Improving the characterization of P-stability for applications in network privacy (Q277631) (← links)
• On the complexity of interactive proofs with bounded communication (Q293359) (← links)
• Sequential Monte Carlo for counting vertex covers in general graphs (Q294226) (← links)
• Estimating the range of a function in an online setting (Q294695) (← links)
• Algorithms to approximately count and sample conforming colorings of graphs (Q299070) (← links)
• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
• The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
• Stochastic enumeration method for counting NP-hard problems (Q352890) (← links)
• Grey-box steganography (Q393133) (← links)
• Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
• Colorful triangle counting and a \textsc{MapReduce} implementation (Q413300) (← links)
• The complexity of approximately counting stable roommate assignments (Q440007) (← links)
• The complexity of approximately counting stable matchings (Q441846) (← links)
• Approximating the number of double cut-and-join scenarios (Q441869) (← links)
• Approximating fixation probabilities in the generalized Moran process (Q472467) (← links)
• Uniform and Bernoulli measures on the boundary of trace monoids (Q491977) (← links)
• The worm process for the Ising model is rapidly mixing (Q504198) (← links)
• Two approximate algorithms for model counting (Q507433) (← links)
• Stochastic enumeration method for counting trees (Q518856) (← links)
• A sequential algorithm for generating random graphs (Q603928) (← links)
• Rigorous confidence bounds for MCMC under a geometric drift condition (Q617654) (← links)
• An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (Q620956) (← links)
• On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (Q652625) (← links)
• Bounded-depth circuits cannot sample good codes (Q692999) (← links)
• Counting and sampling SCJ small parsimony solutions (Q740977) (← links)
• Approximating the partition function of planar two-state spin systems (Q743131) (← links)
• Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time (Q764322) (← links)
• Planar graph coloring is not self-reducible, assuming P\(\neq NP\) (Q805625) (← links)
• Combinatorics of TCP reordering (Q857780) (← links)
• \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← links)
• Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
• Fast uniform generation of regular graphs (Q909471) (← links)
• On the complexity of ranking (Q920620) (← links)
• Inapproximability of the Tutte polynomial (Q937302) (← links)
• Dispersion of mass and the complexity of randomized geometric algorithms (Q947778) (← links)
• Random sampling of colourings of sparse random graphs with a constant number of colours (Q954987) (← links)
• An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
• On coupling and the approximation of the permanent (Q1115170) (← links)
• Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
• On the random generation and counting of matchings in dense graphs (Q1129018) (← links)
• The complexity of controlled selection (Q1173958) (← links)
• On sets polynomially enumerable by iteration (Q1176233) (← links)
• Approximating the permanent of graphs with large factors (Q1199692) (← links)
• Probabilistic complexity classes and lowness (Q1263979) (← links)
• Computational complexity of loss networks (Q1318715) (← links)
• The complexity of computing maximal word functions (Q1321032) (← links)
• Monte Carlo approximation of form factors with error bounded a priori (Q1355196) (← links)
• A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)