Average case optimality (Q1071513): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0885-064x(85)90023-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999786887 / rank | |||
Normal rank |
Latest revision as of 08:45, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Average case optimality |
scientific article |
Statements
Average case optimality (English)
0 references
1985
0 references
Information-based complexity studies problems where only partial and contaminated information is available. One simply states how well a problem should be solved and indicates the type of information available. The theory then yields the optimal information, the optimal algorithm, and bounds on the problem complexity. In this paper we discuss some recent results dealing with the average case setting, i.e., the setting where both the cost and the error are measured on the average.
0 references
Information-based complexity
0 references
optimal information
0 references
optimal algorithm
0 references
bounds on the problem complexity
0 references
average case
0 references
0 references
0 references