scientific article; zbMATH DE number 6007902

MaRDI QIDQ3115267zbMATH OpenFDO

Authors L. A. Zaozerskaya, A. A. Kolokolov, N. G. Gofman

Publication date 20 February 2012

zbMATH Keywords

average time analysisexpected computation timeprobabilistic analysis

Mathematics Subject Classification ID

Boolean programming (90C09) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 4070628
• Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
• An upper bound on the average number of iterations of the LLL algorithm
• Optimal bounds for the approximation of Boolean functions and some applications
• Optimal bounds on the approximation of Boolean functions with consequences on the concept of hardness
• Bounds for the average-case complexity of monotone Boolean functions
• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
• On the complexity of finding the number of solutions of systems of Boolean equations
• scientific article; zbMATH DE number 3885655
• The complexity of approximate algorithms for the problem of integer programming

Cited in

(5)

• Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
• Upper bounds on the number of solutions of binary integer programs
• scientific article; zbMATH DE number 4070628 (Why is no real title available?)
• Estimation of the number of iterations in integer programming algorithms using the regular partitions method
• scientific article; zbMATH DE number 808811 (Why is no real title available?)

This page was built for publication:

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