Title of article
An Extremal Problem in the Hypercube and Optimization of Asynchronous Circuits
Author/Authors
Carlos Gustavo T. de A. Moreira، نويسنده , , Carlos and Emanuel، نويسنده , , Pablo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
3
From page
529
To page
531
Abstract
We prove that if m ≥ 2, then the minimumk ∈ N such that the k -cube {0, 1}kcan be decomposed as the disjoint union of m connected adjacent subsets satisfies 2log2m − log2log2m − 1 ≤ k ≤ 2⌈log2m⌉ − ⌊log2log2m⌋ + 5.
Journal title
European Journal of Combinatorics
Serial Year
2000
Journal title
European Journal of Combinatorics
Record number
1548051
Link To Document