On the public citation graph
A Slight Sharpening of LMN
0 signed · 24 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.1006/jcss.1995.1043openalex-snapshot
An O(nlog log n) Learning Algorithm for DNF under the Uniform Distribution
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1145/12130.12132openalex-snapshot
Almost optimal lower bounds for small depth circuits
inferredcites →https://doi.org/10.1145/174130.174138openalex-snapshot
Constant depth circuits, Fourier transform, and learnability
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-0-387-30162-4_195openalex-snapshot
Learning Constant-Depth Circuits
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_195openalex-snapshot
Learning Constant-Depth Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_14openalex-snapshot
Learning $$AC^0$$ Under k-Dependent Distributions
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_12openalex-snapshot
Variable Influences in Conjunctive Normal Forms
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_44openalex-snapshot
Learning and Lower Bounds for AC 0 with Threshold Gates
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_195-2openalex-snapshot
Learning Constant-Depth Circuits (1993; Linial, Mansour, Nisan)
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_47openalex-snapshot
On the Average Sensitivity and Density of k-CNF Formulas
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.1007/s10994-010-5179-6openalex-snapshot
Polynomial regression under arbitrary product distributions
inferred← citeshttps://doi.org/10.1017/cbo9781139814782openalex-snapshot
Analysis of Boolean Functions
inferred← citeshttps://doi.org/10.1109/ccc.2013.33openalex-snapshot
The Distinguishability of Product Distributions by Read-Once Branching Programs
inferred← citeshttps://doi.org/10.1145/1754399.1754401openalex-snapshot
Polylogarithmic independence fools AC 0 circuits
inferred← citeshttps://doi.org/10.1145/3618260.3649662openalex-snapshot
On the Pauli Spectrum of QAC0
inferred← citeshttps://doi.org/10.1145/3618260.3649687openalex-snapshot
Optimal Non-adaptive Tolerant Junta Testing via Local Estimators
inferred← citeshttps://doi.org/10.1561/0400000109openalex-snapshot
Paradigms for Unconditional Pseudorandom Generators
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2017.15openalex-snapshot
Tight Bounds on the Fourier Spectrum of AC0
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2024.18openalex-snapshot
On K-wise Independent Distributions and Boolean Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2101.08303openalex-snapshot
From Local Pseudorandom Generators to Hardness of Learning
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.