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

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

Latest revision as of 00:13, 24 July 2024

scientific article; zbMATH DE number 7269934
Language Label Description Also known as
English
Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
scientific article; zbMATH DE number 7269934

    Statements

    Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms (English)
    0 references
    0 references
    0 references
    4 November 2020
    0 references
    bootstrap method
    0 references
    counting problems
    0 references
    computational complexity
    0 references
    approximation algorithms
    0 references
    Monte Carlo simulation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references