Threshold Logic
Threshold Logic is a computational model of combinational logic in which a logical function is realized by a threshold gate that computes a weighted sum of inputs and compares it to a threshold value, distinguishing it from conventional logic models by its ability to implement arbitrary Boolean functions through linear separability.
391
Publications
13.6K
Citations
809
Authors
338
Institutions
Publications per year
2017–2026
47
391
Threshold circuits of bounded depth
A. Hajnal, Wolfgang Maass, Pavel Pudlák et al. · Journal of Computer and System Sciences · 1993 · 240 citations
1–5 of 391
809
10
h-index
10
h-index
10
h-index
9
h-index
9
h-index
1–5 of 809
338
Arizona State University
Tempe, United States
11 h-index
32 publications
1K citations
Instituto de Microelectrónica de Sevilla
Seville, Spain
10 h-index
30 publications
1.2K citations
Purdue University West Lafayette
West Lafayette, United States
10 h-index
25 publications
1K citations
RCA (United States)
New York, United States
10 h-index
12 publications
691 citations

Delft University of Technology
Delft, The Netherlands
9 h-index
22 publications
652 citations
Princeton University
Princeton, United States
7 h-index
21 publications
947 citations
University of California, Berkeley
Berkeley, United States
7 h-index
15 publications
360 citations
Fujitsu (Japan)
Kawasaki, Japan
7 h-index
24 publications
670 citations
1–8 of 338
21 publications · 610 citations
13
h-index
15 publications · 382 citations
11
h-index
8 publications · 479 citations
8
h-index
8 publications · 287 citations
8
h-index
7 publications · 305 citations
7
h-index
1–5