Pages that link to "Item:Q3834934"
From MaRDI portal
The following pages link to Monte-Carlo approximation algorithms for enumeration problems (Q3834934):
Displaying 50 items.
- Using the Monte Carlo method for fast simulation of the number of ``good'' permutations on the SCIT-4 multiprocessor computer complex (Q289789) (← links)
- Sequential Monte Carlo for counting vertex covers in general graphs (Q294226) (← links)
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- The worm process for the Ising model is rapidly mixing (Q504198) (← links)
- Queries and materialized views on probabilistic databases (Q532366) (← links)
- Lower bounds for sampling algorithms for estimating the average (Q674290) (← links)
- Counting curves and their projections (Q677992) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- An OpenCL implementation of a forward sampling algorithm for CP-logic (Q900368) (← links)
- A genetic algorithm for joint replenishment based on the exact inventory cost (Q947954) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- On counting 3-D matchings of size \(k\) (Q1040648) (← links)
- An analysis of Monte Carlo algorithms for counting problems (Q1083200) (← links)
- A Bayesian approach to relevance in game playing (Q1127355) (← links)
- On the random generation and counting of matchings in dense graphs (Q1129018) (← links)
- Approximating the permanent of graphs with large factors (Q1199692) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
- Testing the shift-equivalence of polynomials using quantum machines (Q1356318) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870) (← links)
- An optimal approximation algorithm for Bayesian inference (Q1402716) (← links)
- Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks. (Q1593281) (← links)
- Approximating the number of monomer-dimer coverings of a lattice. (Q1593404) (← links)
- Approximate inference in Bayesian networks: parameterized complexity results (Q1726381) (← links)
- On deterministic approximation of DNF (Q1923857) (← links)
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk. (Q1963611) (← links)
- Monte Carlo approaches to parameterized poker squares (Q1989566) (← links)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting (Q2009190) (← links)
- Approximate weighted model integration on DNF structures (Q2082501) (← links)
- Data source selection for approximate query (Q2084622) (← links)
- Probability estimation via policy restrictions, convexification, and approximate sampling (Q2097639) (← links)
- Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
- On the connection between interval size functions and path counting (Q2410681) (← links)
- Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT (Q2450932) (← links)
- Probabilistic verification and approximation (Q2478551) (← links)
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) (← links)
- A Monte Carlo algorithm for a lottery problem (Q2724981) (← links)
- Self-testing algorithms for self-avoiding walks (Q2737885) (← links)
- Power indices and the measurement of control in corporate structures (Q2852567) (← links)
- Inverse Sampling for Nonasymptotic Sequential Estimation of Bounded Variable Means (Q2941681) (← links)
- A Bernoulli mean estimate with known relative error distribution (Q2977564) (← links)
- On Counting Parameterized Matching and Packing (Q4632178) (← links)
- ARITHMETIC OF POTTS MODEL HYPERSURFACES (Q4917807) (← links)
- (Q5136333) (← links)
- Completeness Results for Counting Problems with Easy Decision (Q5283355) (← links)
- Generalized loop‐erased random walks and approximate reachability (Q5409862) (← links)
- Approximate set union via approximate randomization (Q5918258) (← links)
