Formula Complexity

Formula Complexity is a measure in circuit complexity that quantifies the minimum number of logical connectives required to express a Boolean function as a formula, distinguished from general circuit complexity by its restriction to tree-like structures without shared subformulas.

192

Publications

9.5K

Citations

313

Authors

186

Institutions

Publications per year

2017–2026

9

Authors

313

  1. NH
    Nader H. Bshouty

    University of Calgary, Canada

    6 publications · 131 citations

    6

    h-index

  2. LH
    Lisa Hellerstein

    Northwestern University, United States

    5 publications · 295 citations

    5

    h-index

  3. PH
    Petr Hájek

    University of Pardubice, Czechia

    4 publications · 94 citations

    4

    h-index

  4. NI
    Neil Immerman

    University of Massachusetts Amherst, United States

    4 publications · 207 citations

    4

    h-index

  5. RC
    Richard Cleve

    University of Calgary, Canada

    3 publications · 58 citations

    3

    h-index

1–5 of 313

Venues

  1. SIAM Journal on Computing

    14 publications · 444 citations

    13

    h-index

  2. Journal of Computer and System Sciences

    5 publications · 414 citations

    5

    h-index

  3. Random Structures and Algorithms

    5 publications · 234 citations

    5

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 5 publications · 71 citations

    5

    h-index

  5. Information Processing Letters

    5 publications · 215 citations

    5

    h-index

1–5