No CrossRef data available.
Published online by Cambridge University Press: 06 November 2000
Let A be an m × n matrix and q := [lfloor]log2(m)[rfloor]+1. In this article we improve the well-known bound lindisc(A) [les ] 2 herdisc(A) and show that
formula here
As with the previous proofs relating to this problem, ours is constructive. We will give an on-line algorithm and analyse it using game theory.