Pages that link to "Item:Q3581284"
From MaRDI portal
The following pages link to Approximate counting by dynamic programming (Q3581284):
Displayed 24 items.
- Sequential Monte Carlo for counting vertex covers in general graphs (Q294226) (← links)
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← links)
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies (Q337192) (← links)
- Stochastic enumeration method for counting trees (Q518856) (← links)
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (Q652625) (← links)
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes (Q784479) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- A fully polynomial-time approximation scheme for approximating a sum of random variables (Q1785211) (← links)
- A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
- Estimating the probability of meeting a deadline in schedules and plans (Q2321333) (← links)
- Faster FPTASes for counting and random generation of knapsack solutions (Q2417856) (← links)
- The Complexity of Computing the Optimal Composition of Differential Privacy (Q2796124) (← links)
- Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra (Q3466783) (← links)
- Random walks on the vertices of transportation polytopes with constant number of sources (Q3608299) (← links)
- (Q4568112) (← links)
- Randomization methods for assessing data analysis results on real‐valued matrices (Q4969690) (← links)
- A Faster FPTAS for #Knapsack (Q5002742) (← links)
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518) (← links)
- Completeness Results for Counting Problems with Easy Decision (Q5283355) (← links)
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries (Q5323079) (← links)
- Graph classes and the switch Markov chain for matchings (Q5963358) (← links)
- On computing probabilistic abductive explanations (Q6116531) (← links)
- Discrete Optimal Transport with Independent Marginals is #P-Hard (Q6155882) (← links)