1802 search results - page 2 / 361 » Complexity Theory for Operators in Analysis |
STOC
1989
ACM
13 years 9 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
ICALP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
ECSQARU
2007
Springer
13 years 9 months ago
2007
Springer
In possibility theory, the degree of inconsistency is commonly used to measure the level of conflict in information from multiple sources after merging, especially conjunctive merg...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...