Advanced search
Publication Cover
Journal of Statistical Computation and Simulation Volume 15, 1982 - Issue 1
Submit an article Journal homepage
189
Views
95
CrossRef citations to date
0
Altmetric
Original Articles

Algorithmic complexity: three NP- hard problems in computational statistics

William J. Welch Department of Mathematics, Imperial College, London, SW7 2BZ, Great Briatain
Pages 17-25 | Received 23 Sep 1980, Published online: 20 Mar 2007

References

  • Beale , E.M.L. , Kendall , M.G. and Mann , D.W. 1967 . The discarding of variables in multivariate analysis . Biometrika , 54 : 357 – 366 .
  • Cook , S.A. The complexity of theorem-proving procedures . Proc. Third Annual ACM Symp. on Theory of Computing . New York. pp. 151 – 158 . Association for Computing Machinery .
  • Cormack , R.M. 1971 . A review of classification . J. Roy. Statist. Soc , 134 : 321 – 367 .
  • Edmonds , J. 1965 . Paths, trees, and flowers. Canad . J. Math , 17 : 449 – 467 .
  • Everitt , B.S. 1974 . Cluster analysis , London : Heinemann .
  • Friedman , H.P. and Rubin , J. 1967 . On some invariant criteria for grouping data . J. Amer. Statist. Assoc , 62 : 1159 – 1178 .
  • Furnival , G.M. and Wilson , R.W. 1974 . Regression by leaps and bounds . Technometrics , 16 : 499 – 511 .
  • Garey , M.R. and Johnson , D.S. 1979 . Computers and Intractability: A Guide to the Theory of n p-Completeness , San Francisco : Freeman .
  • Hansen , P. and Delattre , M. 1978 . Complete-link cluster analysis by graph coloring . J. Amer. Statist Assoc , 73 : 397 – 403 .
  • Hocking , R.R. 1976 . The analysis and selection of variables in linear regression . Biometrics , 32 : 1 – 49 .
  • Karp , R.M. 1972 . “ Reducibility among combinatorial problems ” . In Complexity of Computer Computations , Edited by: Miller , R.E. and Thatcher , J.W. 85 – 103 . New York : Plenum Press .
  • Kiefer , J. and Wolfowitz , J. 1959 . Optimum designs in regression problems . Ann. Math. Statist , 30 : 271 – 294 .
  • LaMotte , L.R. and Hocking , R R. 1970 . Computational efficiency in the selection of regression variables . Technometrics , 12 : 83 – 93 .
  • Mitchell , T.J. 1974 . An algorithm for the construction of D-optimal experimental designs . Technometrics , 16 : 203 – 210 .
  • St. John , R.C. and Draper , N.R. 1975 . D-optimality for regression designs: a review . Technometrics , 17 : 15 – 23 .
  • Tarjan , R.E. 1978 . Complexity of combinational algorithms . SIAM Rev , 20 : 457 – 491 .
  • Welch , W.J. 1982 . Branch-and-bound search for experimental designs based upon D optimality and other criteria . Technometrics , 20

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.