J. F. Traub, & A. G. Werschulz. (2001). Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory; Complexity theory: Quadratic programming; Computational complexity theory; Fractional combinatorial optimization; Kolmogorov complexity; Mixed integer nonlinear programming; NP-complete problems and proof methodology; Parallel computing: Complexity classes INFORMATION-BASED COMPLEXITY AND INFORMATION-BASED OPTIMIZATION. Springer US, 2001. https://doi.org/10.1007/0-306-48332-7_210

J. F. TRAUB und A. G. WERSCHULZ, 2001. Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory; Complexity theory: Quadratic programming; Computational complexity theory; Fractional combinatorial optimization; Kolmogorov complexity; Mixed integer nonlinear programming; NP-complete problems and proof methodology; Parallel computing: Complexity classes INFORMATION-BASED COMPLEXITY AND INFORMATION-BASED OPTIMIZATION [online]. Springer US, 2001. Available from: https://academiccommons.columbia.edu/doi/10.7916/D8 QV3 ZND/download

J. F. Traub, und A. G. Werschulz. Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory; Complexity theory: Quadratic programming; Computational complexity theory; Fractional combinatorial optimization; Kolmogorov complexity; Mixed integer nonlinear programming; NP-complete problems and proof methodology; Parallel computing: Complexity classes INFORMATION-BASED COMPLEXITY AND INFORMATION-BASED OPTIMIZATION. Springer US, 2001., 2001, https://doi.org/10.1007/0-306-48332-7_210.

J. F. Traub/A. G. Werschulz: Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory; Complexity theory: Quadratic programming; Computational complexity theory; Fractional combinatorial optimization; Kolmogorov complexity; Mixed integer nonlinear programming; NP-complete problems and proof methodology; Parallel computing: Complexity classes INFORMATION-BASED COMPLEXITY AND INFORMATION-BASED OPTIMIZATION, 2001.

J. F. Traub und A. G. Werschulz. (2001), Complexity classes in optimization; Complexity of degeneracy; Complexity of gradients, Jacobians, and Hessians; Complexity theory; Complexity theory: Quadratic programming; Computational complexity theory; Fractional combinatorial optimization; Kolmogorov complexity; Mixed integer nonlinear programming; NP-complete problems and proof methodology; Parallel computing: Complexity classes INFORMATION-BASED COMPLEXITY AND INFORMATION-BASED OPTIMIZATION, Bd. , Springer US, 2001., verfügbar unter:https://doi.org/10.1007/0-306-48332-7_210.