On computational complexity of construction of c -optimal linear regression models over finite experimental domains

[1] ARORA, S.-BARAK, B.: Computational Complexity. A Modern Approach. Cambridge University Press, Cambridge, 2009.10.1017/CBO9780511804090Search in Google Scholar

[2] ATKINSON, A.-DONEV, A.-TOBIAS, R.: Optimum Experimental Designs with SAS. Oxford University Press, Oxford, 2007.Search in Google Scholar

[3] ˇC ERN´Y, M.-HLAD´IK, M.: Two complexity results on c-optimality in experimental design, Computational Optimization and Applications 51 2012, 1397-1408, http://www.springerlink.com/content/115ttx6lu150434k/fulltext.pdf10.1007/s10589-010-9377-8Search in Google Scholar

[4] ˇC ERN´Y, M.-HLAD´IK, M.-SKOˇCDOPOLOV´A, V.: On computationally complex in- stances of the c-optimal experimental design problem: Breaking RSA-based cryptography via c-optimal designs, in: Proc. of 19th Internat. Conference on Comput. Statist.- -CompStat ’10 (Y. Lechevallier, G. Saporta, eds.), Paris, France, Physica Verlag, Heidel- berg, 2010, pp. 879-886.Search in Google Scholar

[5] EDMONDS, J.: Systems of distinct representatives and linear algebra, J. Res. Natl. Bur. Stand., Sec. B 71B (1967), 241-245.10.6028/jres.071B.033Search in Google Scholar

[6] GREENLAW, R.-HOOVER, H.-RUZZO, W.: Limits to Parallel Computation. P-completeness Theory. Oxford University Press, Oxford, 1995.10.1093/oso/9780195085914.001.0001Search in Google Scholar

[7] HARMAN, R.-JUR´IK, T.: Computing c-optimal experimental designs using the simplex method of linear programming, Comput. Statist. Data Anal. 53 (2008), 247-254.10.1016/j.csda.2008.06.023Search in Google Scholar

[8] KHACHIYAN, L.: A polynomial algorithm for linear programming, Dokl. Akad. Nauk SSSR 244 (1979), No. 5, 1093-1096.Search in Google Scholar

[9] KLEE, V.-MINTY, G. J.: How good is the simplex algorithm? Inequalities III, in: Proc. of the 3rd Symposium on Inequalities held at the University of California, Los Angeles, Calif., 1969 (O. Shisha, ed.), Academic Press, New York, 1972, pp. 159-175.Search in Google Scholar

[10] ODIFREDDI, P.: Classical Recursion Theory. Volume I. Stud. Logic Found. Math., Vol. 125, Elsevier, Amsterdam, 1999.Search in Google Scholar

[11] PAPADIMITRIOU, C.: Computational Complexity. Addison-Wesley, Longman, 1995.Search in Google Scholar

[12] P´AZMAN, A.: Foundations of Optimum Experimental Design. Reidel Publ. Comp., Dordrecht, 1986.Search in Google Scholar

[13] PUKELSHEIM, F.-RIEDER, S.: Efficient rounding in approximate designs, Biometrika 79 (1992), 763-770.10.1093/biomet/79.4.763Search in Google Scholar

[14] RAO, C. R.: Linear Statistical Inference and its Applications. John Wiley & Sons, New York, 1973.10.1002/9780470316436Search in Google Scholar

[15] ROOS, C.-TERLAKY, T.-VIAL, J.-P.: Interior Point Methods for Linear Optimization . Springer, Heidelberg, 2006.Search in Google Scholar

[16] SCHRIJVER, A.: Theory of Linear and Integer Programming. John Wiley & Sons, New York, 2000.Search in Google Scholar

[17] WHITTLE, P.: Some general points in the theory of optimal experimental design, J. Roy. Statist. Soc. Ser. B. 35 (1973), 123-130.Search in Google Scholar