Approximate counting by dynamic programming
From MaRDI portal
Recommendations
- A deterministic polynomial-time approximation scheme for counting knapsack solutions
- Faster FPTASes for counting and random generation of knapsack solutions
- Faster FPTASes for counting and random generation of knapsack solutions
- scientific article; zbMATH DE number 6861894
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
Cited in
(30)- A fully polynomial-time approximation scheme for approximating a sum of random variables
- A faster FPTAS for counting two-rowed contingency tables
- Estimating the probability of meeting a deadline in schedules and plans
- Faster FPTASes for counting and random generation of knapsack solutions
- The complexity of computing the optimal composition of differential privacy
- Faster FPTASes for counting and random generation of knapsack solutions
- Sequential Monte Carlo for counting vertex covers in general graphs
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
- OPTIMAL DYNAMIC BOX-COUNTING ALGORITHM
- Approximate counting : an alternative approach
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
- Model counting of monotone conjunctive normal form formulas with spectra
- Random walks on the vertices of transportation polytopes with constant number of sources
- The complexity of computing the optimal composition of differential privacy
- Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
- Randomization methods for assessing data analysis results on real‐valued matrices
- A faster FPTAS for \#Knapsack
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
- Stochastic enumeration method for counting trees
- Completeness results for counting problems with easy decision
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
- Graph classes and the switch Markov chain for matchings
- On computing probabilistic abductive explanations
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
- A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
- Linear-time uniform generation of random sparse contingency tables with specified marginals
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
- Knapsack polytopes: a survey
This page was built for publication: Approximate counting by dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581284)
