Pages that link to "Item:Q1079379"

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

Displayed 50 items.

• 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)
• 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)
• On the number of occurrences of a symbol in words of regular languages. (Q1401339) ‎ (← links)
• An inequality for polymatroid functions and its applications. (Q1410680) ‎ (← links)
• Sensitivity analysis of a railway station track layout with respect to a given timetable (Q1806663) ‎ (← links)
• An analysis of Monte Carlo algorithm for estimating the permanent (Q1842570) ‎ (← links)
• Uniform generation of NP-witnesses using an NP-oracle (Q1854397) ‎ (← links)
• Perfect sampling using bounding chains. (Q1879888) ‎ (← links)
• On approximating weighted sums with exponentially many terms (Q1880781) ‎ (← links)
• Counting consistent phylogenetic trees is \#P-complete (Q1883389) ‎ (← links)
• Counting and sampling \(H\)-colourings (Q1887143) ‎ (← links)
• Note on the knapsack Markov chain. (Q1888773) ‎ (← links)
• A mildly exponential approximation algorithm for the permanent (Q1923855) ‎ (← links)
• On the number of Eulerian orientations of a graph (Q1923856) ‎ (← links)
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) ‎ (← links)
• Fast perfect sampling from linear extensions (Q2368931) ‎ (← links)
• On enumerating minimal dicuts and strongly connected subgraphs (Q2471808) ‎ (← links)
• Proving SAT does not have small circuits with an application to the two queries problem (Q2475408) ‎ (← links)
• Probabilistic verification and approximation (Q2478551) ‎ (← links)
• Random bichromatic matchings (Q2482731) ‎ (← links)
• Lower bounds for non-black-box zero knowledge (Q2490264) ‎ (← links)
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265) ‎ (← links)
• Uniform generation in spatial constraint databases and applications (Q2495401) ‎ (← links)
• The Potts model and the Tutte polynomial (Q2737867) ‎ (← links)
• Self-testing algorithms for self-avoiding walks (Q2737885) ‎ (← links)
• On the effective generation of set elements within specified ranges (Q3141999) ‎ (← links)
• Random Generation for Finitely Ambiguous Context-free Languages (Q3147017) ‎ (← links)
• Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on <b>Z</b>² (Q3430817) ‎ (← links)
• How to get more mileage from randomness extractors (Q3522834) ‎ (← links)
• Approximating the permanent: A simple approach (Q4286300) ‎ (← links)
• A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) ‎ (← links)
• A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs (Q4314146) ‎ (← links)