On the public citation graph
The average sensitivity of square-freeness
0 signed · 21 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.1007/3-540-48686-0_29openalex-snapshot
On the Average Sensitivity of Testing Square-Free Numbers
inferredcites →https://doi.org/10.1007/978-3-0348-8664-2openalex-snapshot
Number theoretic methods in cryptography : complexity lower bounds
inferredcites →https://doi.org/10.1007/bf01263419openalex-snapshot
On the degree of boolean functions as real polynomials
inferredcites →https://doi.org/10.1016/0304-3975(93)90330-vopenalex-snapshot
Improvements on Khrapchenko's theorem
inferredcites →https://doi.org/10.1016/s0020-0190(97)00131-2openalex-snapshot
The average sensitivity of bounded-depth circuits
inferredcites →https://doi.org/10.1109/12.45216openalex-snapshot
A spectral lower bound technique for the size of decision trees and two-level AND/OR circuits
inferredcites →https://doi.org/10.1137/0220005openalex-snapshot
Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
inferredcites →https://doi.org/10.1137/s0097539791224285openalex-snapshot
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines
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.1006/inco.2000.3017openalex-snapshot
Circuit and Decision Tree Complexity of Some Number Theoretic Problems
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_26openalex-snapshot
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
inferred← citeshttps://doi.org/10.1007/s00037-003-0176-9openalex-snapshot
Complexity of some arithmetic problems for binary polynomials
inferred← citeshttps://doi.org/10.1007/s00037-016-0134-yopenalex-snapshot
Fourier Concentration from Shrinkage
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.11.001openalex-snapshot
On the average sensitivity of the weighted sum function
inferred← citeshttps://doi.org/10.1016/j.ipl.2016.01.002openalex-snapshot
The simplified weighted sum function and its average sensitivity
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.037openalex-snapshot
Subset sum “cubes” and the complexity of primality testing
inferred← citeshttps://doi.org/10.1109/ccc.2014.39openalex-snapshot
Fourier Concentration from Shrinkage
inferred← citeshttps://doi.org/10.1109/ijcnn.2004.1380065openalex-snapshot
On a generalization complexity measure for Boolean functions
inferred← citeshttps://doi.org/10.1109/tnn.2006.872352openalex-snapshot
The influence of oppositely classified examples on the generalization complexity of Boolean functions
inferred← citeshttps://doi.org/10.3390/math8061035openalex-snapshot
On the Lyapunov Exponent of Monotone Boolean Networks †
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.