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
Parents
9
Verifying Properties of Binarized Deep Neural Networks
Nina Narodytska, Shiva Prasad Kasiviswanathan, Leonid Ryzhyk et al. · 2018 · 192 citations · Full text
Approximate Boolean operations on free-form solids
Henning Biermann, Daniel Kristjansson, Denis Zorin · 2001 · 107 citations
1–5 of 9
23
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 23
11
International Data Group (Sweden)
Stockholm, Sweden
2 h-index
2 publications
236 citations
Amazon (Germany)
Berlin, Germany
2 h-index
2 publications
236 citations
New York University
New York, United States
1 h-index
2 publications
214 citations

Data61
Sydney, Australia
1 h-index
1 publications
192 citations
RWTH Aachen University
Aachen, Germany
1 h-index
3 publications
102 citations
University of Udine
Udine, Italy
1 h-index
2 publications
70 citations
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento
Lisbon, Portugal
1 h-index
2 publications
66 citations
Universidade Católica de Pelotas
Pelotas, Brazil
1 h-index
1 publications
33 citations
1–8 of 11
Conference · 1 publications · 44 citations
1
h-index
1 publications · 35 citations
1
h-index
1 publications · 34 citations
1
h-index
Conference · 1 publications · 33 citations
1
h-index
1–4