Logic Decomposition
Logic Decomposition is a method in combinational logic synthesis that systematically breaks down complex logic functions into simpler, interrelated subfunctions while preserving overall functionality and optimizing for implementation constraints.
307
Publications
11.1K
Citations
526
Authors
251
Institutions
Publications per year
2017–2026
50
307
A logical analysis of modules in logic programming
Dale Miller · The Journal of Logic Programming · 1989 · 235 citations
1–5 of 307
526
13
h-index
11
h-index
10
h-index
8
h-index
7
h-index
1–5 of 526
251
University of California, Berkeley
Berkeley, United States
16 h-index
43 publications
2.7K citations
Eindhoven University of Technology
Eindhoven, The Netherlands
12 h-index
25 publications
486 citations
Warsaw University of Technology
Warsaw, Poland
11 h-index
23 publications
560 citations

Silesian University of Technology
Gliwice, Poland
11 h-index
20 publications
448 citations

Portland State University
Portland, United States
10 h-index
19 publications
659 citations
Intel (United States)
Santa Clara, United States
9 h-index
10 publications
323 citations

University of Toronto
Toronto, Canada
8 h-index
15 publications
471 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
8 h-index
12 publications
261 citations
1–8 of 251
22 publications · 1.1K citations
18
h-index
9 publications · 311 citations
9
h-index
8 publications · 225 citations
7
h-index
6 publications · 256 citations
6
h-index
Conference · 5 publications · 113 citations
5
h-index
1–5