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
Parents
192
The complexity of satisfiability problems
Thomas J. Schaefer · 1978 · 1.8K citations · Full text
∑11-Formulae on finite structures
Miklós Ajtai · Annals of Pure and Applied Logic · 1983 · 586 citations
Query evaluation via tree-decompositions
Jörg Flum, Markus Frick, Martin Grohe · Journal of the ACM · 2002 · 219 citations
1–5 of 192
313
6
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 313
186

Czech Academy of Sciences
Prague, Czechia
10 h-index
12 publications
307 citations

TU Wien
Vienna, Austria
8 h-index
12 publications
355 citations

Harvard University Press
Cambridge, United States
6 h-index
8 publications
332 citations

University of Toronto
Toronto, Canada
6 h-index
7 publications
226 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
6 publications
136 citations
Université Paris Cité
Paris, France
5 h-index
5 publications
134 citations
Technion – Israel Institute of Technology
Haifa, Israel
5 h-index
6 publications
262 citations
Czech Academy of Sciences, Institute of Computer Science
Prague, Czechia
5 h-index
5 publications
157 citations
1–8 of 186
14 publications · 444 citations
13
h-index
5 publications · 414 citations
5
h-index
5 publications · 234 citations
5
h-index
Repository · 5 publications · 71 citations
5
h-index
5 publications · 215 citations
5
h-index
1–5