Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (Q5130518): Difference between revisions

@@ Property / author @@
+Dimitris J. Bertsimas
@@ Property / author: Dimitris J. Bertsimas / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+gmp
@@ Property / describes a project that uses: gmp / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+LattE
@@ Property / describes a project that uses: LattE / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MPFR
@@ Property / describes a project that uses: MPFR / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1287/opre.2019.1904
+Normal rank
@@ Property / OpenAlex ID @@
+W3021208818
@@ Property / OpenAlex ID: W3021208818 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q120689983
@@ Property / Wikidata QID: Q120689983 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
+Normal rank
@@ Property / cites work @@
+The Power of Optimization Over Randomization in Designing Experiments Involving Small Samples
+Normal rank
@@ Property / cites work @@
+An exact iterated bootstrap algorithm for small-sample bias reduction.
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Effective lattice point counting in rational convex polytopes
+Normal rank
@@ Property / cites work @@
+More accurate confidence intervals in exponential families
+Normal rank
@@ Property / cites work @@
+Bootstrap confidence intervals. With comments and a rejoinder by the authors
+Normal rank
@@ Property / cites work @@
+Probability
@@ Property / cites work: Probability / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate counting by dynamic programming
@@ Property / cites work: Approximate counting by dynamic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of stochastic programming problems
+Normal rank
@@ Property / cites work @@
+Sampling contingency tables
@@ Property / cites work: Sampling contingency tables / rank @@
+Normal rank
@@ Property / cites work @@
+A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem
+Normal rank
@@ Property / cites work @@
+On the Complexity of Computing the Volume of a Polyhedron
+Normal rank
@@ Property / cites work @@
+Bootstrap methods: another look at the jackknife
@@ Property / cites work: Bootstrap methods: another look at the jackknife / rank @@
+Normal rank
@@ Property / cites work @@
+Q3959963
@@ Property / cites work: Q3959963 / rank @@
+Normal rank
@@ Property / cites work @@
+Better Bootstrap Confidence Intervals
@@ Property / cites work: Better Bootstrap Confidence Intervals / rank @@
+Normal rank
@@ Property / cites work @@
+The Distribution of Order Statistics for Discrete Random Variables with Applications to Bootstrapping
+Normal rank
@@ Property / cites work @@
+MPFR
@@ Property / cites work: MPFR / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Integer Multiplication
@@ Property / cites work: Faster Integer Multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Modern Computer Algebra
@@ Property / cites work: Modern Computer Algebra / rank @@
+Normal rank
@@ Property / cites work @@
+An FPTAS for #Knapsack and Related Counting Problems
+Normal rank
@@ Property / cites work @@
+Theoretical comparison of bootstrap confidence intervals
+Normal rank
@@ Property / cites work @@
+A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
+Normal rank
@@ Property / cites work @@
+A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
+Normal rank
@@ Property / cites work @@
+A comment on ``Computational complexity of stochastic programming problems''
+Normal rank
@@ Property / cites work @@
+Q3508462
@@ Property / cites work: Q3508462 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster polynomial multiplication via multipoint Kronecker substitution
+Normal rank
@@ Property / cites work @@
+Efficient computation of the performance of bootstrap and jackknife estimators of the variance of<i>L</i>-statistics
+Normal rank
@@ Property / cites work @@
+The Exact Bootstrap Mean and Variance of an <i>L</i>-estimator
+Normal rank
@@ Property / cites work @@
+The exact bootstrap method shown on the example of the mean and variance estimation
+Normal rank
@@ Property / cites work @@
+Allocating Bandwidth for Bursty Connections
@@ Property / cites work: Allocating Bandwidth for Bursty Connections / rank @@
+Normal rank
@@ Property / cites work @@
+Linear and Integer Programming vs Linear Integration and Counting
+Normal rank
@@ Property / cites work @@
+A fully polynomial-time approximation scheme for approximating a sum of random variables
+Normal rank
@@ Property / cites work @@
+Hard Enumeration Problems in Geometry and Combinatorics
+Normal rank
@@ Property / cites work @@
+Fast multiplication of large numbers
@@ Property / cites work: Fast multiplication of large numbers / rank @@
+Normal rank
@@ Property / cites work @@
+A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank