On the public citation graph
On the planar monotone computation of threshold functions
0 signed · 27 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/bf00264232openalex-snapshot
A 2.5n lower bound on the monotone network complexity of T3n
inferredcites →https://doi.org/10.1007/bf01683282openalex-snapshot
On the combinational complexity of certain symmetric Boolean functions
inferredcites →https://doi.org/10.1007/bf01747074openalex-snapshot
Method of determining lower bounds for the complexity of P-schemes
inferredcites →https://doi.org/10.1016/0020-0190(80)90117-9openalex-snapshot
A space efficient algorithm for the monotone planar circuit value problem
inferredcites →https://doi.org/10.1016/0196-6774(84)90016-6openalex-snapshot
Short monotone formulae for the majority function
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.1109/sfcs.1984.715953openalex-snapshot
Constructing O(n Log n) Size Monotone Formulae For The k-th Elementary Symmetric Polynomial Of n Boolean Variables
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/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0211033openalex-snapshot
$\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas
inferredcites →https://doi.org/10.1145/321879.321882openalex-snapshot
Bounds to Complexities of Networks for Sorting and for Switching
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-54458-5_68openalex-snapshot
Nonlinear lower bounds on the number of processors of circuits with sublinear separators
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_37openalex-snapshot
Limiting Negations in Bounded Treewidth and Upward Planar Circuits
inferred← citeshttps://doi.org/10.1007/bf01277954openalex-snapshot
On the complexity of planar Boolean circuits
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90068-5openalex-snapshot
On the planar monotone computation of boolean functions
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90150-3openalex-snapshot
Functions computed by monotone boolean formulas with no repeated variables
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90079-uopenalex-snapshot
Lower bounds on the area complexity of Boolean circuits
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90003-kopenalex-snapshot
Planar acyclic computation
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90041-yopenalex-snapshot
Nonlinear lower bounds on the number of processors of circuits with sublinear separators
inferred← citeshttps://doi.org/10.1016/j.aam.2020.102161openalex-snapshot
Freezing sandpiles and Boolean threshold networks: Equivalence and complexity
inferred← citeshttps://doi.org/10.1070/rm2003v058n05abeh000667openalex-snapshot
Monotone Boolean functions
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.