On the public citation graph
Boolean functions whose monotone complexity is of size n2/log n
0 signed · 37 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/3-540-07389-2_214openalex-snapshot
Monotone switching circuits and boolean matrix product
inferredcites →https://doi.org/10.1007/3-540-09526-8_36openalex-snapshot
Some remarks on Boolean sums
inferredcites →https://doi.org/10.1007/bf00263988openalex-snapshot
A new lower bound on the monotone network complexity of Boolean sums
inferredcites →https://doi.org/10.1016/0304-3975(75)90009-2openalex-snapshot
Complexity of monotone networks for Boolean matrix product
inferredcites →https://doi.org/10.1016/0304-3975(79)90008-2openalex-snapshot
Switching functions whose monotone complexity is nearly quadratic
inferredcites →https://doi.org/10.1016/0304-3975(80)90034-1openalex-snapshot
On another Boolean matrix
inferredcites →https://doi.org/10.1016/s0167-5060(08)70326-1openalex-snapshot
Complexity of Monotone Networks for Computing Conjunctions
inferredcites →https://doi.org/10.1109/swat.1974.9openalex-snapshot
Combinational complexity of some monotone functions
inferredcites →https://doi.org/10.1109/tc.1972.5009021openalex-snapshot
An Improved Lower Bound for Sorting Networks
inferredcites →https://doi.org/10.1109/tc.1979.1675245openalex-snapshot
The Complexity of Monotone Networks for Certain Bilinear Forms, Routing Problems, Sorting, and Merging
inferredcites →https://doi.org/10.1137/0204027openalex-snapshot
The Power of Negative Thinking in Multiplying Boolean Matrices
inferredcites →https://doi.org/10.1145/321958.321962openalex-snapshot
Shifting Graphs and Their Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-13331-3_58openalex-snapshot
Proving lower bounds on the monotone complexity of Boolean functions
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_29openalex-snapshot
Towards an Almost Quadratic Lower Bound on the Monotone Circuit Complexity of the Boolean Convolution
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_2openalex-snapshot
On Negations in Boolean Networks
inferred← citeshttps://doi.org/10.1007/bf00264232openalex-snapshot
A 2.5n lower bound on the monotone network complexity of T3n
inferred← citeshttps://doi.org/10.1007/bf01157687openalex-snapshot
Lower bounds on monotone complexity of the logical permanent
inferred← citeshttps://doi.org/10.1007/bf02579196openalex-snapshot
The monotone circuit complexity of boolean functions
inferred← citeshttps://doi.org/10.1007/bfb0024012openalex-snapshot
Planar circuits have short specifications
inferred← citeshttps://doi.org/10.1007/bfb0030339openalex-snapshot
On the complexity of slice functions
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90011-xopenalex-snapshot
Relating monotone formula size and monotone depth of boolean functions
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90030-1openalex-snapshot
An Ω(n43) lower bound on the monotone network complexity of the nth degree convolution
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90209-9openalex-snapshot
On the complexity of slice functions
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90122-2openalex-snapshot
The complexity of central slice functions
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90176-3openalex-snapshot
More on the complexity of slice functions
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90057-0openalex-snapshot
Constructive universal algebra: an introduction
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90166-1openalex-snapshot
Entropy of contact circuits and lower bounds on their complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90142-4openalex-snapshot
On monotone simulations of nonmonotone networks
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50019-9openalex-snapshot
The Complexity of Finite Functions
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80035-7openalex-snapshot
An n3/2 lower bound on the monotone network complexity of the Boolean convolution
inferred← citeshttps://doi.org/10.1070/rm2003v058n05abeh000667openalex-snapshot
Monotone Boolean functions
inferred← citeshttps://doi.org/10.1109/sfcs.1981.10openalex-snapshot
An O(N4/3) lower bound on the mono tone network complexity of N-TH degree convolution
inferred← citeshttps://doi.org/10.1145/3188745.3188912openalex-snapshot
On the complexity of hazard-free circuits
inferred← citeshttps://doi.org/10.1145/800061.808739openalex-snapshot
Exponential lower bounds for restricted monotone circuits
inferred← citeshttps://doi.org/10.14288/1.0051610openalex-snapshot
Growth processes on formulas and reversible circuits
inferred← citeshttps://doi.org/10.7146/brics.v3i42.20024openalex-snapshot
The Complexity of Computing the k-ary Composition of a Binary Associative Operator
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.