Sciweavers

8824 search results - page 48 / 1765
» On the Complexity of Real Functions
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 3 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
TAPSOFT
1997
Springer
14 years 1 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
PROMISE
2010
13 years 4 months ago
The role of the measure of functional complexity in effort estimation
Background. Currently there are several definitions of measures that should represent the size of software functional requirements. These measures have gained a quite relevant rol...
Luigi Lavazza, Gabriela Robiolo
ICSM
2002
IEEE
14 years 2 months ago
Measuring Software Functional Size: Towards an Effective Measurement of Complexity
Data manipulation, or algorithmic complexity, is not taken into account adequately in any of the most popular functional size measurement methods. In this paper, we recall some we...
De Tran-Cao, Ghislain Lévesque, Alain Abran
GECCO
2004
Springer
14 years 3 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter