Finite Set Partitioning

Finite Set Partitioning is a mathematical construct that belongs to the class of set-theoretic operations, specifically denoting the division of a finite set into a collection of non-overlapping (disjoint) non-empty subsets such that every element of the original set is included in exactly one subset, thereby forming a complete and exclusive decomposition of the set.

46

Publications

2.3K

Citations

85

Authors

55

Institutions

Publications per year

2017–2026

2

Authors

85

  1. JF
    Jürgen Freudenberger

    HTWG Hochschule Konstanz - Technik, Wirtschaft und Gestaltung, Germany

    3 publications · 55 citations

    3

    h-index

  2. SS
    Sergo Shavgulidze

    Georgian Technical University, Georgia

    3 publications · 55 citations

    3

    h-index

  3. TP
    Toniann Pitassi

    University of Toronto, Canada

    2 publications · 222 citations

    2

    h-index

  4. RF
    Robert F. H. Fischer

    Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany

    2 publications · 25 citations

    2

    h-index

  5. RI
    Russell Impagliazzo

    University of California San Diego, United States

    2 publications · 222 citations

    2

    h-index

1–5 of 85

Venues

  1. IEEE Transactions on Communications

    4 publications · 869 citations

    4

    h-index

  2. IEEE Transactions on Information Theory

    2 publications · 30 citations

    2

    h-index

  3. The Computer Journal

    2 publications · 63 citations

    2

    h-index

  4. Journal of Combinatorial Theory Series A

    2 publications · 74 citations

    2

    h-index

  5. Management Science

    2 publications · 105 citations

    2

    h-index

1–5