On the public citation graph
$\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas
0 signed · 34 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00264601openalex-snapshot
Complexity hierarchies for Boolean functions
inferredcites →https://doi.org/10.1016/0022-0000(78)90038-7openalex-snapshot
The circuit depth of symmetric boolean functions
inferredcites →https://doi.org/10.1016/0304-3975(76)90035-9openalex-snapshot
Lower bounds for the size of expressions for certain functions in d-ary logic
inferredcites →https://doi.org/10.1016/0304-3975(78)90021-xopenalex-snapshot
An explicit construction of short monotone formulae for the monotone symmetric functions
inferredcites →https://doi.org/10.1016/s0049-237x(08)70524-xopenalex-snapshot
Lengths of Formulas and Elimination of Quantifiers I
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1145/321574.321587openalex-snapshot
The Logical Complexity of Geometric Properties in the Plane
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1997.1287openalex-snapshot
Better Lower Bounds for Monotone Threshold Formulas
inferred← citeshttps://doi.org/10.1007/3-540-13331-3_57openalex-snapshot
Bounds for Hodes - Specker theorem
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_58openalex-snapshot
On some communication complexity problems related to threshold functions
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_5openalex-snapshot
Finding Efficient Circuits Using SAT-Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_37openalex-snapshot
Formula Complexity of Ternary Majorities
inferred← citeshttps://doi.org/10.1007/978-3-642-72905-8_17openalex-snapshot
Boolean Complexity and Ramsey Theorems
inferred← citeshttps://doi.org/10.1007/bf01271371openalex-snapshot
Shallow circuits and concise formulae for multiple addition and multiplication
inferred← citeshttps://doi.org/10.1007/bfb0024011openalex-snapshot
On the planar monotone computation of threshold functions
inferred← citeshttps://doi.org/10.1007/bfb0024012openalex-snapshot
Planar circuits have short specifications
inferred← citeshttps://doi.org/10.1007/bfb0030331openalex-snapshot
A lower bound on complexity of branching programs
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90137-2openalex-snapshot
A note on the formula size of the “mod k” functions
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90036-wopenalex-snapshot
On the depth complexity of the counting functions
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90080-2openalex-snapshot
Lower bounds to the complexity of symmetric Boolean functions
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00048-nopenalex-snapshot
On almost bad Boolean bases
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50019-9openalex-snapshot
The Complexity of Finite Functions
inferred← citeshttps://doi.org/10.1070/rm2003v058n05abeh000667openalex-snapshot
Monotone Boolean functions
inferred← citeshttps://doi.org/10.1109/sct.1990.113958openalex-snapshot
Perfect hashing, graph entropy, and circuit complexity
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185384openalex-snapshot
Better bounds for threshold formulas
inferred← citeshttps://doi.org/10.1137/0215040openalex-snapshot
Bounds for Width Two Branching Programs
inferred← citeshttps://doi.org/10.1137/s0895480190283595openalex-snapshot
Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
inferred← citeshttps://doi.org/10.1515/dma-2017-0003openalex-snapshot
Upper bounds for the size and the depth of formulae for MOD-functions
inferred← citeshttps://doi.org/10.22331/q-2024-04-09-1312openalex-snapshot
Quantum advantage in temporally flat measurement-based quantum computation
inferred← citeshttps://doi.org/10.3103/s1066369x14050041openalex-snapshot
Upper bounds for the formula size of symmetric Boolean functions
inferred← citeshttps://doi.org/10.4213/dm1373openalex-snapshot
Верхние оценки сложности и глубины формул для MOD-функций
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.