8824 search results - page 88 / 1765 » On the Complexity of Real Functions |
119
click to vote
JACM
2000
15 years 3 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
133
click to vote
JSYML
2002
15 years 3 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
152
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
171
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
This paper presents an efficient method to compute the maximum likelihood (ML) estimation of the parameters of a complex 2-D sinusoidal, with the complexity order of the FFT. The...
142
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...