On the public citation graph
Size-depth tradeoff in monotone Boolean formulae
0 signed · 29 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-08860-1_11openalex-snapshot
Size — Depth tradeoff in boolean formulas
inferredcites →https://doi.org/10.1007/bf00264256openalex-snapshot
Size-depth tradeoff in non-monotone Boolean formulae
inferredcites →https://doi.org/10.1007/bf01070501openalex-snapshot
Effect of the depth of formulas on their complexity
inferredcites →https://doi.org/10.1016/0304-3975(80)90074-2openalex-snapshot
A 3n-lower bound on the network complexity of Boolean functions
inferredcites →https://doi.org/10.1016/0378-4754(79)90115-0openalex-snapshot
The complexity of computing
inferredcites →https://doi.org/10.1109/sfcs.1975.29openalex-snapshot
The effect of basis on size of Boolean expressions
inferredcites →https://doi.org/10.1109/t-c.1973.223757openalex-snapshot
The Parallel Evaluation of Arithmetic Expressions Without Division
inferredcites →https://doi.org/10.1109/tc.1976.1674647openalex-snapshot
Efficient Parallel Evaluation of Boolean Expressions
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1145/321958.321973openalex-snapshot
Restructuring of Arithmetic Expressions For Parallel Evaluation
inferredcites →https://doi.org/10.1145/800116.803750openalex-snapshot
A 2.5 n-lower bound on the combinational complexity of Boolean functions
inferredcites →https://doi.org/10.1145/800116.803751openalex-snapshot
Lower bounds on the size of Boolean formulas
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00264256openalex-snapshot
Size-depth tradeoff in non-monotone Boolean formulae
inferred← citeshttps://doi.org/10.1007/bf01130356openalex-snapshot
Bounds for parallel addition time of two numbers
inferred← citeshttps://doi.org/10.1007/bf01744302openalex-snapshot
On the depth complexity of formulas
inferred← citeshttps://doi.org/10.1007/bf02667162openalex-snapshot
Vertical processing of integer group-data streams. II. Application to binary arithmetic operations
inferred← citeshttps://doi.org/10.1007/bf02667924openalex-snapshot
Vertical processing of integer group-data streams. III. application to binary arithmetic operations
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.007openalex-snapshot
Constructing depth-optimum circuits for adders and And-Or paths
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116167openalex-snapshot
Faster linear-size And-Or Path and adder circuits
inferred← citeshttps://doi.org/10.1070/rm2003v058n05abeh000667openalex-snapshot
Monotone Boolean functions
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185387openalex-snapshot
Size-depth tradeoffs for algebraic formulae
inferred← citeshttps://doi.org/10.1134/s1990478908020063openalex-snapshot
On possibility of refining bounds for the delay of a parallel adder
inferred← citeshttps://doi.org/10.1134/s1990478919040161openalex-snapshot
On a Relation Between the Depth and Complexity of Monotone Boolean Formulas
inferred← citeshttps://doi.org/10.1137/s0097539792232586openalex-snapshot
Size-Depth Tradeoffs for Algebraic Formulas
inferred← citeshttps://doi.org/10.1145/3340321openalex-snapshot
Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times
inferred← citeshttps://doi.org/10.17513/snt.39149openalex-snapshot
BITWISE-PARALLEL BINARY PROCESSING WITHOUT TRANSFER CALCULATION IN TERMS OF PERFORMANCE IMPROVEMENT AND ERROR REDUCTION
inferred← citeshttps://doi.org/10.33048/daio.2019.26.643openalex-snapshot
On a relation between the depth and complexity of monotone Boolean formulas
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.