Towards the Succinct Representation of m Out of n

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Combinations of n objects taken m at the time are ubiquitous in a wide range of combinatorial problems. In this paper, we introduce a novel approach to generate combinations from given integer numbers by using a gradient-based algorithm through plural number of CPU and GPU processors. The time complexity is bounded by O(m2) when using a single processor, and bounded by O(mlog m) when using at most O(m/ log m) processors. Relevant computational experiments confirmed the practical efficiency within computationally allowable limits. Our approach offers the building blocks to represent combinations with succinct encoding and complexity being independent of n, which is meritorious when n is very large, or when n is time-varying.

Original languageEnglish
Title of host publicationInternet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings
EditorsAntonio Guerrieri, Jason J. Jung, Giancarlo Fortino, Jingtao Sun, Yang Xiang
PublisherSpringer Verlag
Pages16-26
Number of pages11
ISBN (Print)9783030027377
DOIs
Publication statusPublished - 2018 Jan 1
Event11th International Conference on Internet and Distributed Computing Systems, IDCS 2018 - Tokyo, Japan
Duration: 2018 Oct 112018 Oct 13

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11226 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Conference on Internet and Distributed Computing Systems, IDCS 2018
CountryJapan
CityTokyo
Period18/10/1118/10/13

Keywords

  • Combinations
  • Complexity
  • Optimization
  • Parallel computing
  • Representation
  • Unranking

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Towards the Succinct Representation of m Out of n'. Together they form a unique fingerprint.

  • Cite this

    Parque, V., & Miyashita, T. (2018). Towards the Succinct Representation of m Out of n. In A. Guerrieri, J. J. Jung, G. Fortino, J. Sun, & Y. Xiang (Eds.), Internet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings (pp. 16-26). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11226 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-02738-4_2