On the public citation graph
Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits
0 signed · 28 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/bfb0030331openalex-snapshot
A lower bound on complexity of branching programs
inferredcites →https://doi.org/10.1016/0304-3975(90)90080-2openalex-snapshot
Lower bounds to the complexity of symmetric Boolean functions
inferredcites →https://doi.org/10.1109/sfcs.1983.30openalex-snapshot
Lower bounds by probabilistic arguments
inferredcites →https://doi.org/10.1109/sfcs.1986.31openalex-snapshot
Meanders, Ramsey theory and lower bounds for branching programs
inferredcites →https://doi.org/10.1145/12130.12134openalex-snapshot
Two lower bounds for branching programs
inferredcites →https://doi.org/10.1145/800061.808736openalex-snapshot
Bounds for width two branching programs
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/978-1-4612-2566-9_8openalex-snapshot
On Proving Lower Bounds for Circuit Size
inferred← citeshttps://doi.org/10.1007/978-1-4614-7258-2_26openalex-snapshot
On Small Size Approximation Models
inferred← citeshttps://doi.org/10.1007/s00453-022-01091-yopenalex-snapshot
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
inferred← citeshttps://doi.org/10.1007/s10958-012-1104-9openalex-snapshot
Circuit complexity of linear functions: gate elimination and feeble security
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00037-9openalex-snapshot
Directed monotone contact networks for threshold functions
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00305-0openalex-snapshot
Comparing the sizes of nondeterministic branching read-k-times programs
inferred← citeshttps://doi.org/10.1070/rm2012v067n01abeh004777openalex-snapshot
Computational complexity of Boolean functions
inferred← citeshttps://doi.org/10.1109/sct.1993.336535openalex-snapshot
On proving lower bounds for circuit size
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365684openalex-snapshot
Efficient oblivious branching programs for threshold functions
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646113openalex-snapshot
Making nondeterminism unambiguous
inferred← citeshttps://doi.org/10.1134/s1990478910020122openalex-snapshot
A lower bound on the computation complexity of characteristic functions for BCH-codes by branching programs
inferred← citeshttps://doi.org/10.1137/s0097539798339041openalex-snapshot
Making Nondeterminism Unambiguous
inferred← citeshttps://doi.org/10.1145/2213977.2214024openalex-snapshot
Tight bounds for monotone switching networks via fourier analysis
inferred← citeshttps://doi.org/10.1515/dma-2025-0026openalex-snapshot
A lower bound on the monotone switching complexity of the threshold function Tnn−1 $T_n^{n-1}$
inferred← citeshttps://doi.org/10.5772/37084openalex-snapshot
Provably Secure Cryptographic Constructions
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.