On the public citation graph
On the Power of Small-Depth Computation
0 signed · 63 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.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1006/inco.1995.1136openalex-snapshot
Boosting a Weak Learning Algorithm by Majority
inferredcites →https://doi.org/10.1006/jcss.1995.1069openalex-snapshot
Separating the Communication Complexities of MOD m and MOD p Circuits
inferredcites →https://doi.org/10.1007/3-540-44666-4_28openalex-snapshot
On the Derandomization of Constant Depth Circuits
inferredcites →https://doi.org/10.1007/978-3-662-04943-3openalex-snapshot
Boolean Functions and Computation Models
inferredcites →https://doi.org/10.1007/bf00189260openalex-snapshot
Efficient cryptographic schemes provably as secure as subset sum
inferredcites →https://doi.org/10.1007/bf01200426openalex-snapshot
Majority gates vs. general weighted threshold gates
inferredcites →https://doi.org/10.1007/bf01201278openalex-snapshot
On the correlation of symmetric functions
inferredcites →https://doi.org/10.1007/bf01215346openalex-snapshot
The expressive power of voting polynomials
inferredcites →https://doi.org/10.1007/bf01263420openalex-snapshot
When do extra majority gates help? Polylog (N) majority gates are equivalent to one
inferredcites →https://doi.org/10.1007/bf01272517openalex-snapshot
On the power of small-depth threshold circuits
inferredcites →https://doi.org/10.1007/bf01375474openalex-snapshot
Pseudorandom bits for constant depth circuits
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/pl00001602openalex-snapshot
The BNS-Chung criterion for multi-party communication complexity
inferredcites →https://doi.org/10.1007/s00037-007-0238-5openalex-snapshot
Randomness-Efficient Sampling within NC1
inferredcites →https://doi.org/10.1007/s00037-009-0273-5openalex-snapshot
The Sum of D Small-Bias Generators Fools Polynomials of Degree D
inferredcites →https://doi.org/10.1007/s00039-001-0332-9openalex-snapshot
A new proof of Szemerédi's theorem
inferredcites →https://doi.org/10.1007/s000390050065openalex-snapshot
A New Proof of Szemer�di's Theorem for Arithmetic Progressions of Length Four
inferredcites →https://doi.org/10.1016/0020-0190(93)90041-7openalex-snapshot
nω(log n) lower bounds on the size of depth-3 threshold cicuits with AND gates at the bottom
inferredcites →https://doi.org/10.1016/0022-0000(89)90033-0openalex-snapshot
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0022-0000(92)90047-mopenalex-snapshot
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
inferredcites →https://doi.org/10.1016/0022-0000(93)90001-dopenalex-snapshot
Threshold circuits of bounded depth
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1016/j.crma.2005.03.008openalex-snapshot
Estimation of certain exponential sums arising in complexity theory
inferredcites →https://doi.org/10.1016/j.crma.2005.07.011openalex-snapshot
Bounds on an exponential sum arising in Boolean circuit complexity
inferredcites →https://doi.org/10.1016/j.jcss.2004.01.003openalex-snapshot
The correlation between parity and quadratic polynomials mod3
inferredcites →https://doi.org/10.1016/j.jcss.2005.06.007openalex-snapshot
Symmetric polynomials over Zm and simultaneous communication protocols
inferredcites →https://doi.org/10.1017/cbo9780511581274openalex-snapshot
Concentration of Measure for the Analysis of Randomized Algorithms
inferredcites →https://doi.org/10.1017/s0013091505000325openalex-snapshot
AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1137/0215070openalex-snapshot
Log Depth Circuits for Division and Related Problems
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
inferredcites →https://doi.org/10.1137/0406009openalex-snapshot
Communication Complexity and Quasi Randomness
inferredcites →https://doi.org/10.1137/050640941openalex-snapshot
Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates
inferredcites →https://doi.org/10.1145/1374376.1374480openalex-snapshot
On the constant-depth complexity of k-clique
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-030-36030-6_16openalex-snapshot
The Function-Inversion Problem: Barriers and Opportunities
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_2openalex-snapshot
Lower Bounds for Unrestricted Boolean Circuits: Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_16openalex-snapshot
Small Ball Probability, Inverse Theorems, and Applications
inferred← citeshttps://doi.org/10.1007/s00037-017-0153-3openalex-snapshot
Block-symmetric polynomials correlate with parity better than symmetric
inferred← citeshttps://doi.org/10.1007/s00037-026-00296-9openalex-snapshot
A Technique for Hardness Amplification Against $$\textsf{AC}^0$$
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105192openalex-snapshot
Depth-3 circuits for inner product
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.041openalex-snapshot
Arithmetic circuits: The chasm at depth four gets wider
inferred← citeshttps://doi.org/10.1109/ccc.2012.39openalex-snapshot
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators
inferred← citeshttps://doi.org/10.1137/080735096openalex-snapshot
Hardness Amplification Proofs Require Majority
inferred← citeshttps://doi.org/10.1137/20m1364886openalex-snapshot
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization
inferred← citeshttps://doi.org/10.1145/2090236.2090273openalex-snapshot
On beating the hybrid argument
inferred← citeshttps://doi.org/10.1145/3061640.3061648openalex-snapshot
Selected challenges in computational lower bounds
inferred← citeshttps://doi.org/10.1145/3188745.3188938openalex-snapshot
More consequences of falsifying SETH and the orthogonal vectors conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1805.08554openalex-snapshot
More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture
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.