• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Improved bounds on the partitioning of the Boolean lattice into chains of equal size.

István Tomon
Published in: Discret. Math. (2016)
Keyphrases
  • image segmentation
  • lower bound
  • real valued
  • search algorithm
  • upper bound
  • small size
  • worst case
  • boolean functions
  • worst case bounds
  • genetic algorithm
  • computational complexity
  • np hard
  • lattice structure