Exact Boolean Computation

Exact Boolean Computation is a formal computational method that performs logically precise set-theoretic operations on Boolean variables or geometric representations, ensuring mathematically correct results without approximation, discretization, or numerical error.

9

Publications

489

Citations

23

Authors

11

Institutions

Publications per year

2017–2026

3

Authors

23

  1. TW
    Toby Walsh

    Data61, Australia

    2 publications · 236 citations

    2

    h-index

  2. MS
    Mooly Sagiv

    Tel Aviv University, Israel

    2 publications · 236 citations

    2

    h-index

  3. NN
    Nina Narodytska

    Data61, Australia

    2 publications · 236 citations

    2

    h-index

  4. LR
    Leonid Ryzhyk

    Data61, Australia

    2 publications · 236 citations

    2

    h-index

  5. SP
    Shiva Prasad Kasiviswanathan

    Samsung (United States), United States

    2 publications · 236 citations

    2

    h-index

1–5 of 23

Venues

  1. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 1 publications · 44 citations

    1

    h-index

  2. Theoretical Computer Science

    1 publications · 35 citations

    1

    h-index

  3. Computer-Aided Design

    1 publications · 34 citations

    1

    h-index

  4. 1

    h-index

1–4