Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Tatra Mountains Mathematical Publications
Volume 51 (2012): Issue 1 (April 2012)
Open Access
On computational complexity of construction of c -optimal linear regression models over finite experimental domains
Jaromír Antoch
Jaromír Antoch
,
Michal Černý
Michal Černý
and
Milan Hladík
Milan Hladík
| Nov 13, 2012
Tatra Mountains Mathematical Publications
Volume 51 (2012): Issue 1 (April 2012)
PROBASTAT ‘11
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
Nov 13, 2012
Page range:
11 - 21
DOI:
https://doi.org/10.2478/v10127-012-0002-3
Keywords
optimal design
,
c-optimality
,
P-completeness
,
parallel computation
,
linear programming
,
SAC algorithm
This content is open access.
Jaromír Antoch
Charles University of Prague Department of Probability and Mathematical Statistics Sokolovsk´a 83 CZ–186-75 Prague 8 CZECH REPUBLIC
Michal Černý
University of Economics Prague Department of Econometrics Winston Churchill Square 4 CZ–130-67 Prague CZECH REPUBLIC
Milan Hladík
Charles University of Prague Department of Applied Mathematics Malostransk´e n´amˇest´ı 25 CZ–118-00 Prague 1 CZECH REPUBLIC