Article thumbnail

An Extremal Problem in the Hypercube and Optimization of Asynchronous Circuits

By Carlos Gustavo T. de A. Moreira and Pablo Emanuel

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⌋ + 5

Publisher: Academic Press.
Year: 2000
DOI identifier: 10.1006/eujc.1999.0359
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://s3-eu-west-1.amazonaws... (external link)
  • https://s3.amazonaws.com/prod-... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.