Boolean Function Equivalence

Boolean Function Equivalence is a formal relation that holds between two Boolean expressions when they yield identical output values for all possible combinations of input values, thereby belonging to the class of logical equivalences with the distinguishing characteristic of preserving functional behavior across distinct syntactic representations.

71

Publications

2K

Citations

135

Authors

92

Institutions

Publications per year

2017–2026

6

Variants

Boolean Equivalence

Authors

135

  1. CC
    Claude Carlet

    Université Paris 8, France

    3 publications · 55 citations

    3

    h-index

  2. JM
    Janett Mohnke

    Princeton University, United States

    3 publications · 147 citations

    3

    h-index

  3. LB
    Lilya Budaghyan

    University of Bergen, Norway

    3 publications · 55 citations

    3

    h-index

  4. NH
    Nader H. Bshouty

    University of Calgary, Canada

    2 publications · 143 citations

    2

    h-index

  5. US
    Ulf Schlichtmann

    Technical University of Munich, Germany

    2 publications · 60 citations

    2

    h-index

1–5 of 135

Venues

  1. IEEE Transactions on Computers

    5 publications · 240 citations

    5

    h-index

  2. IEEE Transactions on Electronic Computers

    5 publications · 117 citations

    5

    h-index

  3. Designs Codes and Cryptography

    3 publications · 87 citations

    3

    h-index

  4. IEEE Transactions on Information Theory

    3 publications · 38 citations

    3

    h-index

  5. 3

    h-index

1–5