Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees
-
T. D. Blaivas
Veröffentlicht/Copyright:
1. Oktober 2004
For a problem of interval search on the Boolean cube, we study the asymptotic behaviour of the average search time in the class of balanced tree circuits on sequences of positive integers {ki } under the assumption that ki are cardinalities of databases. We show that the asymptotic behaviour may differ on different sequences. We give a complete description of the class of possible behaviours.
Published Online: 2004-10-01
Published in Print: 2004-10-01
Copyright 2004, Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Analysis of randomised rounding for integer programs
- Homomorphic relations of algebras with a scheme of operators
- On the connection between the eigen-vectors of weighted graphs and their subgraphs
- The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees
- Properties of systems of defining relations for automata
- Random free trees and forests with constraints on multiplicities of vertices
- On the complexity of Boolean functions with small number of ones
- A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
Artikel in diesem Heft
- Analysis of randomised rounding for integer programs
- Homomorphic relations of algebras with a scheme of operators
- On the connection between the eigen-vectors of weighted graphs and their subgraphs
- The asymptotic behaviour of the complexity of the interval search on the Boolean cube in the class of balanced trees
- Properties of systems of defining relations for automata
- Random free trees and forests with constraints on multiplicities of vertices
- On the complexity of Boolean functions with small number of ones
- A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
