On the public citation graph
A new lower bound on the monotone network complexity of Boolean sums
0 signed · 23 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.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.1137/0203011openalex-snapshot
An Algorithm for the Computation of Linear Forms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9783527670468.ch05openalex-snapshot
Computational Complexity of Graphs
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-09704-6_16openalex-snapshot
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_2openalex-snapshot
On Negations in Boolean Networks
inferred← citeshttps://doi.org/10.1007/bf01157687openalex-snapshot
Lower bounds on monotone complexity of the logical permanent
inferred← citeshttps://doi.org/10.1007/bf01268142openalex-snapshot
PI k mass production and an optimal circuit for the Ne?iporuk slice
inferred← citeshttps://doi.org/10.1007/bfb0017292openalex-snapshot
Boolean functions whose monotone complexity is of size n2/log n
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(89)90084-4openalex-snapshot
Boolean functions whose monotone complexity is of size n2log n
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.014openalex-snapshot
Cancellation-free circuits in unbounded and bounded depth
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00042-8openalex-snapshot
A very simple function that requires exponential size read-once branching programs
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.1137/s0097539705447001openalex-snapshot
Disproving the Single Level Conjecture
inferred← citeshttps://doi.org/10.1561/0400000063openalex-snapshot
Complexity of Linear Boolean Operators
inferred← citeshttps://doi.org/10.48550/arxiv.1406.0017openalex-snapshot
Biclique coverings, rectifier networks and the cost of $\varepsilon$-removal
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.