Randomized complexity

MaRDI QIDQ3081833zbMATH OpenFDO

Authors Jérémy Barbay

Publication date 9 March 2011

zbMATH Keywords

lower boundsprobabilistic algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cited in

(12)

• On the Power of the Randomized Iterate
• Probabilistic quality estimations for combinatorial optimization problems
• Robustness of average-case meta-complexity via pseudorandomness
• Layout Randomization and Nondeterminism
• Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
• scientific article; zbMATH DE number 176067 (Why is no real title available?)
• On the complexity of finite random functions
• An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems
• The randomized complexity of initial value problems
• scientific article; zbMATH DE number 3870594 (Why is no real title available?)
• scientific article; zbMATH DE number 6913819 (Why is no real title available?)
• Randomized optimization: a probabilistic analysis

This page was built for publication: Randomized complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081833)