Sciweavers

29908 search results - page 61 / 5982
» On the Complexity of
Sort
View
COCO
2003
Springer
93views Algorithms» more  COCO 2003»
14 years 2 months ago
The complexity of stochastic sequences
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
Wolfgang Merkle
DEXA
2003
Springer
108views Database» more  DEXA 2003»
14 years 2 months ago
Exploiting Similarity of Subqueries for Complex Query Optimization
Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing compl...
Yingying Tao, Qiang Zhu, Calisto Zuzarte
ICSM
2002
IEEE
14 years 1 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
COMPGEOM
2009
ACM
14 years 1 months ago
Visibility maps of realistic terrains have linear smoothed complexity
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
Mark de Berg, Herman J. Haverkort, Constantinos P....
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 1 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf