On the public citation graph

Shallow circuits and concise formulae for multiple addition and multiplication

https://doi.org/10.1007/bf01271371
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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-08138-0_2openalex-snapshot
New bounds on formula size
inferredcites →https://doi.org/10.1007/3-540-18170-9_185openalex-snapshot
The complexity of symmetric boolean functions
inferredcites →https://doi.org/10.1007/bf01366920openalex-snapshot
The complexity of the realization of symmetrical functions by formulae
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/b978-0-444-88071-0.50019-9openalex-snapshot
The Complexity of Finite Functions
inferredcites →https://doi.org/10.1017/cbo9780511526633.014openalex-snapshot
Optimal Carry Save Networks
inferredcites →https://doi.org/10.1090/mbk/121/32openalex-snapshot
Theory of games and economic behavior
inferredcites →https://doi.org/10.1109/arith.1991.145530openalex-snapshot
Shallow multiplication circuits
inferredcites →https://doi.org/10.1109/fscs.1990.89586openalex-snapshot
Faster Circuits and Shorter Formulae for Multiple Addition, Multiplcation and Symmetric Boolean Functions
inferredcites →https://doi.org/10.1109/pgec.1964.263829openalex-snapshot
Majority Gate Networks
inferredcites →https://doi.org/10.1109/pgec.1964.263830openalex-snapshot
A Suggestion for a Fast Multiplier
inferredcites →https://doi.org/10.1109/t-c.1970.223027openalex-snapshot
On the Addition of Binary Numbers
inferredcites →https://doi.org/10.1109/tec.1961.5219227openalex-snapshot
Signed-Digit Numbe Representations for Fast Parallel Arithmetic
inferredcites →https://doi.org/10.1112/blms/19.1.107openalex-snapshot
PRIMALITY AND CRYPTOGRAPHY (Wiley-Teubner Series in Computer Science)
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/129712.129753openalex-snapshot
Shallow multiplication circuits and wise financial investments

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_5openalex-snapshot
Finding Efficient Circuits Using SAT-Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_37openalex-snapshot
Formula Complexity of Ternary Majorities
inferred← citeshttps://doi.org/10.1007/pl00001610openalex-snapshot
Which bases admit non-trivial shrinkage of formulae?
inferred← citeshttps://doi.org/10.1007/s10958-013-1350-5openalex-snapshot
Complexity of computation in finite fields
inferred← citeshttps://doi.org/10.1016/b978-155860798-9/50005-1openalex-snapshot
Multioperand Addition
inferred← citeshttps://doi.org/10.1016/b978-155860798-9/50014-2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1145/2660267.2660342openalex-snapshot
Optimizing Obfuscation
inferred← citeshttps://doi.org/10.22405/2226-8383-2020-21-1-101-134openalex-snapshot
Умножение
inferred← citeshttps://doi.org/10.3103/s0278641913040080openalex-snapshot
Upper bounds on the depth of symmetric Boolean functions
inferred← citeshttps://doi.org/10.3103/s1066369x14050041openalex-snapshot
Upper bounds for the formula size of symmetric Boolean functions
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.37openalex-snapshot
On One-Round Discrete Voronoi Games
inferred← citeshttps://doi.org/10.48550/arxiv.1208.3874openalex-snapshot
Upper bounds for the formula size of the majority function
inferred← citeshttps://doi.org/10.5555/365411.365755openalex-snapshot
Which formulae shrink under random restrictions
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.