Searching for "The $k$-Equal Problem." – sorted by Relevance.
-
Linear decision trees: volume estimates and topological bounds
- and we shall illustrate the use of this theory in the analysis of the k-equal problem in the next section
- Cited by 47 (5 self) – Add To MetaCart
-
Partitions With Restricted Block Sizes, Möbius Functions And The k-Of-Each Problem.
- . Bjorner, Lov'asz and Yao were originally motivated by the k-equal problem i.e. to determine whether
- Cited by 13 (1 self) – Add To MetaCart
-
Geometric Applications of a Randomized Optimization Technique
- is probably optimal in view of the known \Omega\Gamma n log(n=k)) lower bound for the so-called "k-equal
- Cited by 38 (3 self) – Add To MetaCart
-
SHELLABLE COMPLEXES AND TOPOLOGY OF DIAGONAL ARRANGEMENTS
- ] find lower bounds on the complexity of k-equal problems using the topology of diagonal arrangements
- Add To MetaCart

