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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: On computational complexity of construction of c-optimal linear regression models over finite experimental domains Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://tatra.mat.savba.sk/
Description	Recent complexity-theoretic results on finding c-optimal designs over finite experimental domain X are discussed and their implications for the analysis of existing algorithms and for the construction of new algorithms are shown. Assuming some complexity-theoretic conjectures, we show that the approximate version of c-optimality does not have an efficient parallel implementation. Further, we study the question whether for finding the c-optimal designs over finite experimental domain X there exist a strongly polynomial algorithms and show relations between considered design problem and linear programming. Finally, we point out some complexity-theoretic properties of the SAC algorithm for c-optimality. Recent complexity-theoretic results on finding c-optimal designs over finite experimental domain X are discussed and their implications for the analysis of existing algorithms and for the construction of new algorithms are shown. Assuming some complexity-theoretic conjectures, we show that the approximate version of c-optimality does not have an efficient parallel implementation. Further, we study the question whether for finding the c-optimal designs over finite experimental domain X there exist a strongly polynomial algorithms and show relations between considered design problem and linear programming. Finally, we point out some complexity-theoretic properties of the SAC algorithm for c-optimality. (en)
Title	On computational complexity of construction of c-optimal linear regression models over finite experimental domains On computational complexity of construction of c-optimal linear regression models over finite experimental domains (en)
skos:prefLabel	On computational complexity of construction of c-optimal linear regression models over finite experimental domains On computational complexity of construction of c-optimal linear regression models over finite experimental domains (en)
skos:notation	RIV/00216208:11320/12:10128902!RIV13-GA0-11320___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA201/09/0755), P(GAP403/12/1947)
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Antoch, Jaromír Hladík, Milan
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	156199
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/12:10128902
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	SAC algorithm.; linear programming; parallel computation; P-completeness; c-optimality; Optimal design (en)
http://linked.open.../riv/klicoveSlovo	parallel computation linear programming Optimal design P-completeness SAC algorithm. c-optimality
http://linked.open...odStatuVydavatele	SK - Slovenská republika
http://linked.open...ontrolniKodProRIV	[66C48BF66665]
http://linked.open...i/riv/nazevZdroje	Tatra Mountains Mathematical Publications
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Models of Optimal Economic Decision Making under Instability, Uncertainty and Indeterminacy Modelling nonhomogeneous time series
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	51
http://linked.open...iv/tvurceVysledku	Hladík, Milan Černý, Michal Antoch, Jaromír
http://linked.open...ain/vavai/riv/wos	000314254900002
issn	1210-3195
number of pages	11 (xsd:int)
http://bibframe.org/vocab/doi	10.2478/v10127-012-0002-3
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software