Concepedia

Complexity Of Specific Function Families

Complexity of Specific Function Families is a research contribution in circuit complexity that characterizes the minimal computational resources required by circuits to compute functions within formally defined families, distinguished by its focus on the intrinsic difficulty of specific, well-defined sets of Boolean functions rather than general complexity classes.

44

Publications

4.2K

Citations

82

Authors

57

Institutions

Publications per year

2017–2026

7

Parents

Publications

44

A Machine-Independent Theory of the Complexity of Recursive Functions

Manuel Blum · Journal of the ACM · 1967 · 835 citations · Full text

, , +11

On the Number of Linear Regions of Deep Neural Networks

Guido Montúfar, Razvan Pascanu, Kyunghyun Cho et al. · arXiv (Cornell University) · 2014 · 572 citations · Full text

, , +15

On the Number of Linear Regions of Deep Neural Networks

Guido Montúfar, Razvan Pascanu, Kyunghyun Cho et al. · arXiv (Cornell University) · 2014 · 488 citations · Full text

, , +15

Alan Cobham. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp. 24–30.

Stephen Cook · Journal of Symbolic Logic · 1970 · 387 citations

, , +9

On total functions, existence theorems and computational complexity

Nimrod Megiddo, Christos H. Papadimitriou · Theoretical Computer Science · 1991 · 303 citations

, , +15

1–5 of 44

Authors

82

  1. RP
    Razvan Pascanu

    Google (United States), United States

    2 publications · 1.1K citations

    2

    h-index

  2. PG
    Parikshit Gopalan

    Microsoft (United States), United States

    2 publications · 40 citations

    2

    h-index

  3. YB
    Yoshua Bengio

    Université de Montréal, Canada

    2 publications · 1.1K citations

    2

    h-index

  4. GM
    Guido Montúfar

    Max Planck Institute for Mathematics in the Sciences, Germany

    2 publications · 1.1K citations

    2

    h-index

  5. KC
    Kyunghyun Cho

    New York University, United States

    2 publications · 1.1K citations

    2

    h-index

1–5 of 82

Institutions

57

  1. Weizmann Institute of Science

    Rehovot, Israel

    3 h-index

    3 publications

    117 citations

  2. Canadian Institute for Advanced Research

    Toronto, Canada

    2 h-index

    2 publications

    1.1K citations

  3. Université de Montréal

    Montreal, Canada

    2 h-index

    6 publications

    3.2K citations

  4. Max Planck Institute for Mathematics

    Bonn, Germany

    2 h-index

    2 publications

    1.1K citations

  5. Hebrew University of Jerusalem

    Jerusalem, Israel

    2 h-index

    2 publications

    21 citations

  6. Technion – Israel Institute of Technology

    Haifa, Israel

    2 h-index

    6 publications

    828 citations

  7. Max Planck Institute for Mathematics in the Sciences

    Leipzig, Germany

    2 h-index

    2 publications

    1.1K citations

  8. University of California San Diego

    San Diego, United States

    2 h-index

    2 publications

    325 citations

1–8 of 57

Venues

  1. arXiv (Cornell University)

    Repository · 4 publications · 1.2K citations

    4

    h-index

  2. Journal of Computer and System Sciences

    3 publications · 240 citations

    3

    h-index

  3. Journal of Symbolic Logic

    2 publications · 451 citations

    2

    h-index

  4. Theoretical Computer Science

    2 publications · 323 citations

    2

    h-index

  5. SIAM Journal on Computing

    2 publications · 235 citations

    2

    h-index

1–5