Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
From MaRDI portal
Publication:5130518
DOI10.1287/opre.2019.1904zbMath1445.90025OpenAlexW3021208818WikidataQ120689983 ScholiaQ120689983MaRDI QIDQ5130518
Bradley Sturt, Dimitris J. Bertsimas
Publication date: 4 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2019.1904
computational complexitybootstrap methodMonte Carlo simulationapproximation algorithmscounting problems
Inference from stochastic processes and prediction (62M20) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
- A comment on ``Computational complexity of stochastic programming problems
- The complexity of computing the permanent
- Faster polynomial multiplication via multipoint Kronecker substitution
- Theoretical comparison of bootstrap confidence intervals
- Bootstrap methods: another look at the jackknife
- Bootstrap confidence intervals. With comments and a rejoinder by the authors
- A fully polynomial-time approximation scheme for approximating a sum of random variables
- The exact bootstrap method shown on the example of the mean and variance estimation
- Computational complexity of stochastic programming problems
- Fast multiplication of large numbers
- Effective lattice point counting in rational convex polytopes
- Modern Computer Algebra
- The Distribution of Order Statistics for Discrete Random Variables with Applications to Bootstrapping
- A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
- Efficient computation of the performance of bootstrap and jackknife estimators of the variance ofL-statistics
- A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
- The Power of Optimization Over Randomization in Designing Experiments Involving Small Samples
- MPFR
- Faster Integer Multiplication
- Approximate counting by dynamic programming
- Hard Enumeration Problems in Geometry and Combinatorics
- Better Bootstrap Confidence Intervals
- On the Complexity of Computing the Volume of a Polyhedron
- The Complexity of Enumeration and Reliability Problems
- More accurate confidence intervals in exponential families
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
- Sampling contingency tables
- Allocating Bandwidth for Bursty Connections
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- The Exact Bootstrap Mean and Variance of an L-estimator
- Computational Complexity
- An FPTAS for #Knapsack and Related Counting Problems
- Linear and Integer Programming vs Linear Integration and Counting
- Probability
- An exact iterated bootstrap algorithm for small-sample bias reduction.
