DocumentCode :
489342
Title :
On Average Case Complexity of Problems that are Intractable in the Worst Case
Author :
Wasilkowski, G.W.
Author_Institution :
Department of Computer Science, University of Kentucky, Lexington, KY 40506
fYear :
1992
fDate :
24-26 June 1992
Firstpage :
265
Lastpage :
269
Abstract :
The worst case setting seems to be the most important setting for studying complexity of approximately solved problems. Unfortunately, some problems of practical importance are intractable or even unsolvable in the worst case setting and to cope with the inherent difficulty of such problems one has to switch to other settings. A natural alternative is provided by the average case setting under which worst case intractable and/or unsolvable problems become tractable. In this paper we will discuss some results on multivariate integration and function approximation and show by how much the complexity is reduced when the average case is utilized.
Keywords :
Computer science; Cost function; Function approximation; Integral equations; Stress; Switches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
American Control Conference, 1992
Conference_Location :
Chicago, IL, USA
Print_ISBN :
0-7803-0210-9
Type :
conf
Filename :
4792069
Link To Document :
بازگشت