Have a personal or library account? Click to login
On computational complexity of construction of c -optimal linear regression models over finite experimental domains Cover

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

Tatra Mountains Mathematical Publications
Volume 51 (2012): Issue 1 (April 2012)
By: Jaromír Antoch,  Michal Černý and  Milan Hladík  
Open Access
|Nov 2012

Authors

Jaromír Antoch

antoch@karlin.mff.cuni.cz

Michal Černý

cernym@vse.cz

Milan Hladík

milan.hladik@mff.cuni.cz

DOI: https://doi.org/10.2478/v10127-012-0002-3 | Journal eISSN: 1338-9750 | Journal ISSN: 12103195
Journal RSS Feed
Language: English
Page range: 11 - 21
Published on: Nov 13, 2012
Published by: Slovak Academy of Sciences, Mathematical Institute
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year
Keywords:
optimal design,
c-optimality,
P-completeness,
parallel computation,
linear programming,
SAC algorithm
Related subjects:
Mathematics,
General mathematics

© 2012 Jaromír Antoch, Michal Černý, Milan Hladík, published by Slovak Academy of Sciences, Mathematical Institute
This work is licensed under the Creative Commons License.

Previous articleVolume 51 (2012): Issue 1 (April 2012)Next article