haku: @indexterm complexity / yhteensä: 120
viite: 59 / 120
| Tekijä: | Ìåår, K. Weber, G. W. |
| Otsikko: | Some aspects of studying an optimization or decision problem in different computational models |
| Lehti: | European Journal of Operational Research
2002 : DEC, VOL. 143:2, p. 406-418 |
| Asiasana: | COMPLEXITY MODELS MATHEMATICS MATHEMATICAL ANALYSIS |
| Kieli: | eng |
| Tiivistelmä: | In this paper the authors want to discuss some of the features coming up when analyzing a problem in different complexity theoretic frameworks. The focus will be on two problems. The first is related to mathematical optimization. The authors consider the quadratic programming problem of minimizing a quadratic polynomial on a polyhedron. The authors discuss how the complexity of this problem might change if the authors consider real data together with an algebraic model of computation (the Blum-Shub-Smale model) instead of rational inputs together with the Turing machine model. The results obtained will lead us to the second problem; it deals with the intrinsic structure of complexity classes in models over real - or algebraically closed fields. |
SCIMA