Two complexity results on c-optimality in experimental design

Computational Optimization and Applications

Volumn 51, Issue 3, 2012, Pages 1397-1408

  Černý, Michal ^a   Hladík, Milan ^b  

^a UNIVERSITY OF ECONOMICS   (Czech Republic)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Linear programming; NP completeness; Optimal design; P completeness

Indexed keywords

LINEAR PROGRAMMING; OPTIMAL SYSTEMS; REGRESSION ANALYSIS;

COMPLEXITY RESULTS; DECISION VERSION; EQUIVALENCE THEOREM; NP-COMPLETENESS; OPTIMAL DESIGN; OPTIMIZATION PROBLEMS; P-COMPLETENESS; REGRESSION MODEL;

C (PROGRAMMING LANGUAGE);

EID: 84862022408     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-010-9377-8     Document Type: Article

References (11)

1. Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. Math. 160, 781-793 (2004) (Pubitemid 40447851)
2. Atkinson, A., Donev, A., Tobias, R.: Optimum Experimental Designs with SAS. Oxford University Press, Oxford (2007)
3. Dobkin, D., Lipton, R., Reiss, S.: Linear programming is log-space hard for P. Inf. Process. Lett. 8(2), 96-97 (1979)
4. Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
5. Greenlaw, R., Hoover, H., Ruzzo, W.: Limits to Parallel Computation. P-completeness Theory. Oxford University Press, Oxford (1995)
6. Harman, R., Jurík, T.: Computing c-optimal experimental designs using the simplex method of linear programming. Comput. Stat. Data Anal. 53, 247-254 (2008)
7. Khachyian, L.: A polynomial algorithm for linear programming. Dokl. Soviet Acad. Sci. 244(5), 1093-1096 (1979)
8. Papadimitriou, C.: Computational Complexity. Addison-Wesley, Longman (1995)
9. Pázman, A.: Foundations of Optimum Experimental Design. Reidel, Dordrecht (1986)
10. Pukelsheim, F., Rieder, S.: Efficient rounding in approximate designs. Biometrika 79, 763-770 (1992)
11. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)