On the public citation graph

On the power of uniform families of constant depth threshold circuits

https://doi.org/10.1007/bfb0029603
0 signed · 30 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/bf01137685openalex-snapshot
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
inferredcites →https://doi.org/10.1016/0020-0190(83)90044-3openalex-snapshot
BPP and the polynomial hierarchy
inferredcites →https://doi.org/10.1016/0022-0000(81)90038-6openalex-snapshot
On uniform circuit complexity
inferredcites →https://doi.org/10.1016/0022-0000(88)90030-xopenalex-snapshot
Parallel computation with threshold functions
inferredcites →https://doi.org/10.1016/0022-0000(90)90022-dopenalex-snapshot
On uniformity within NC1
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1109/sfcs.1978.37openalex-snapshot
Two theorems on random polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1987.59openalex-snapshot
Threshold circuits of bounded depth
inferredcites →https://doi.org/10.1109/sfcs.1988.21916openalex-snapshot
Hardness vs. randomness
inferredcites →https://doi.org/10.1109/sfcs.1989.63538openalex-snapshot
A note on the power of threshold circuits
inferredcites →https://doi.org/10.1137/0221003openalex-snapshot
Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms
inferredcites →https://doi.org/10.1145/28395.28404openalex-snapshot
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
inferredcites →https://doi.org/10.1145/76359.76370openalex-snapshot
P-uniform circuit complexity
inferredcites →https://doi.org/10.1145/800061.808762openalex-snapshot
A complexity theoretic approach to randomness

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1994.1057openalex-snapshot
Depth Reduction for Circuits of Unbounded Fan-in
inferred← citeshttps://doi.org/10.1006/jcss.1995.1036openalex-snapshot
The Power of the Middle Bit of a #P Function
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_44openalex-snapshot
On strong separations from AC o
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_94openalex-snapshot
On probabilistic ACC circuits with an exact-threshold output gate
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_11openalex-snapshot
Polynomials and Combinatorial Definitions of Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-99660-8_14openalex-snapshot
Efficient Rational Proofs with Strong Utility-Gap Guarantees
inferred← citeshttps://doi.org/10.1007/bf01263422openalex-snapshot
Perceptrons, PP, and the polynomial hierarchy
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90214-eopenalex-snapshot
Probabilistic polynomials, AC0 functions and the polynomial-time hierarchy
inferred← citeshttps://doi.org/10.1109/fscs.1990.89583openalex-snapshot
ON ACC and threshold circuits
inferred← citeshttps://doi.org/10.1109/sct.1991.160270openalex-snapshot
The perceptron strikes back
inferred← citeshttps://doi.org/10.1109/sct.1992.215376openalex-snapshot
Perceptrons, PP, and the polynomial hierarchy
inferred← citeshttps://doi.org/10.1109/sct.1992.215386openalex-snapshot
The power of the middle bit
inferred← citeshttps://doi.org/10.1109/sct.1995.514863openalex-snapshot
On the structure of low sets [complexity classes]
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185449openalex-snapshot
On ACC (circuit complexity)
inferred← citeshttps://doi.org/10.1145/129712.129755openalex-snapshot
When do extra majority gates help?
inferred← citeshttps://doi.org/10.1145/167088.167226openalex-snapshot
Depth reduction for noncommutative arithmetic circuits
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.