On the public citation graph

Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution

0 signed · 41 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 points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1999.1666openalex-snapshot
Computational Sample Complexity and Attribute-Efficient Learning
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_27openalex-snapshot
On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-57048-8_3openalex-snapshot
Pseudorandom Functions: Three Decades Later
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_4openalex-snapshot
Optimal Cryptographic Hardness of Learning Monotone Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_35openalex-snapshot
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-662-49096-9_8openalex-snapshot
Order-Revealing Encryption and the Hardness of Private Learning
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_16openalex-snapshot
On Public Key Encryption from Noisy Codewords
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00034-4openalex-snapshot
Pac-learning non-recursive prolog clauses
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.07.008openalex-snapshot
Cryptographic hardness for learning intersections of halfspaces
inferred← citeshttps://doi.org/10.1016/j.pmcj.2008.07.001openalex-snapshot
A tamper-proof and lightweight authentication scheme
inferred← citeshttps://doi.org/10.1023/a:1007406511732openalex-snapshot
Hardness Results for Learning First-Order Representations and Programming by Demonstration
inferred← citeshttps://doi.org/10.1109/focs.2006.24openalex-snapshot
Cryptographic Hardness for Learning Intersections of Halfspaces
inferred← citeshttps://doi.org/10.1109/focs.2006.51openalex-snapshot
New Results for Learning Noisy Parities and Halfspaces
inferred← citeshttps://doi.org/10.1137/070694879openalex-snapshot
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
inferred← citeshttps://doi.org/10.1137/20m1344202openalex-snapshot
Quantum Hardness of Learning Shallow Classical Circuits
inferred← citeshttps://doi.org/10.1145/1250790.1250833openalex-snapshot
Interpolation of depth-3 arithmetic circuits with two multiplication gates
inferred← citeshttps://doi.org/10.1145/2539126.2539130openalex-snapshot
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1145/301250.301437openalex-snapshot
Computational sample complexity and attribute-efficient learning
inferred← citeshttps://doi.org/10.1145/3241304openalex-snapshot
Hardness of Approximation Between P and NP
inferred← citeshttps://doi.org/10.1145/3241304.3241305openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3241304.3241306openalex-snapshot
The Frontier of Intractability
inferred← citeshttps://doi.org/10.1145/3241304.3241307openalex-snapshot
Preliminaries
inferred← citeshttps://doi.org/10.1145/3241304.3241308openalex-snapshot
Communication complexity of approximate Nash equilibrium
inferred← citeshttps://doi.org/10.1145/3241304.3241309openalex-snapshot
Brouwer's fixed point
inferred← citeshttps://doi.org/10.1145/3241304.3241310openalex-snapshot
PPAD-hardness of approximation
inferred← citeshttps://doi.org/10.1145/3241304.3241311openalex-snapshot
The generalized circuit problem
inferred← citeshttps://doi.org/10.1145/3241304.3241312openalex-snapshot
Many-player games
inferred← citeshttps://doi.org/10.1145/3241304.3241313openalex-snapshot
Bayesian Nash equilibrium
inferred← citeshttps://doi.org/10.1145/3241304.3241314openalex-snapshot
Market equilibrium
inferred← citeshttps://doi.org/10.1145/3241304.3241315openalex-snapshot
CourseMatch
inferred← citeshttps://doi.org/10.1145/3241304.3241316openalex-snapshot
Birthday Repetition
inferred← citeshttps://doi.org/10.1145/3241304.3241317openalex-snapshot
Densest k-subgraph
inferred← citeshttps://doi.org/10.1145/3241304.3241318openalex-snapshot
Community detection
inferred← citeshttps://doi.org/10.1145/3241304.3241319openalex-snapshot
VC and Littlestone's dimensions
inferred← citeshttps://doi.org/10.1145/3241304.3241320openalex-snapshot
Signaling
inferred← citeshttps://doi.org/10.1145/3241304.3241321openalex-snapshot
2-player approximate Nash equilibrium
inferred← citeshttps://doi.org/10.1145/3241304.3241322openalex-snapshot
References
inferred← citeshttps://doi.org/10.1184/r1/6604301openalex-snapshot
Computational Applications Of Noise Sensitivity
inferred← citeshttps://doi.org/10.4086/toc.2009.v005a013openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1705.09517openalex-snapshot
Inapproximability of VC Dimension and Littlestone's Dimension
inferred← citeshttps://doi.org/10.7916/d8w66sm1openalex-snapshot
On the Learnability of Monotone Functions
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.