An Extremal Problem in the Hypercube and Optimization of Asynchronous Circuits
Abstract
AbstractWe 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⌋ + 5Similar works
This paper was published in Elsevier - Publisher Connector .
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.