On the public citation graph
A lower bound on the mod 6 degree of the OR function
0 signed · 37 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.1016/0022-314x(80)90039-6openalex-snapshot
Diophantine problems in variables restricted to the values 0 and 1
inferredcites →https://doi.org/10.1017/cbo9780511526633.010openalex-snapshot
Some Problems Involving Razborov-Smolensky Polynomials
inferredcites →https://doi.org/10.1109/sct.1993.336538openalex-snapshot
The polynomial method in circuit complexity
inferredcites →https://doi.org/10.1137/s0895480193255505openalex-snapshot
Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $
inferredcites →https://doi.org/10.1145/28395.28404openalex-snapshot
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11523468_80openalex-snapshot
Lower Bounds for Circuits with Few Modular and Symmetric Gates
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/978-3-642-20712-9_3openalex-snapshot
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
inferred← citeshttps://doi.org/10.1007/bfb0055055openalex-snapshot
A degree-decreasing Lemma for (MOD q, MOD p) circuits
inferred← citeshttps://doi.org/10.1007/s00037-010-0290-4openalex-snapshot
The Complexity of Boolean Functions in Different Characteristics
inferred← citeshttps://doi.org/10.1007/s00224-013-9488-6openalex-snapshot
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
inferred← citeshttps://doi.org/10.1007/s00493-014-2367-1openalex-snapshot
Constructing Ramsey Graphs from Boolean Function Representations
inferred← citeshttps://doi.org/10.1007/s004930070032openalex-snapshot
Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.007openalex-snapshot
Symmetric polynomials over Zm and simultaneous communication protocols
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00204-3openalex-snapshot
Constructing set systems with prescribed intersection sizes
inferred← citeshttps://doi.org/10.1017/s0963548302005242openalex-snapshot
Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers
inferred← citeshttps://doi.org/10.1109/ccc.2006.29openalex-snapshot
On Modular Counting with Polynomials
inferred← citeshttps://doi.org/10.1109/ccc.2008.30openalex-snapshot
Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size
inferred← citeshttps://doi.org/10.1109/ccc.2009.14openalex-snapshot
On the Complexity of Boolean Functions in Different Characteristics
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238218openalex-snapshot
Symmetric polynomials over /spl Zopf//sub m/ and simultaneous communication protocols
inferred← citeshttps://doi.org/10.1137/060661259openalex-snapshot
Query-Efficient Algorithms for Polynomial Interpolation over Composites
inferred← citeshttps://doi.org/10.1137/19m1291054openalex-snapshot
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
inferred← citeshttps://doi.org/10.1137/s009753970342465xopenalex-snapshot
Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications
inferred← citeshttps://doi.org/10.1145/3313276.3316401openalex-snapshot
CSPs with global modular constraints: algorithms and hardness via polynomial representations
inferred← citeshttps://doi.org/10.1145/3349618openalex-snapshot
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
inferred← citeshttps://doi.org/10.1145/3624704openalex-snapshot
Optimal Polynomial-Time Compression for Boolean Max CSP
inferred← citeshttps://doi.org/10.21236/ada327984openalex-snapshot
Factoring Polynomials Modulo Composites,
inferred← citeshttps://doi.org/10.3390/math11224651openalex-snapshot
A Note on the LogRank Conjecture in Communication Complexity
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2015.680openalex-snapshot
Two Structural Results for Low Degree Polynomials and Applications
inferred← citeshttps://doi.org/10.46298/dmtcs.289openalex-snapshot
A Degree-Decreasing Lemma for (MOD_q-MOD_p) Circuits
inferred← citeshttps://doi.org/10.46298/dmtcs.341openalex-snapshot
A Note on Set Systems with no Union of Cardinality 0 modulo m
inferred← citeshttps://doi.org/10.48550/arxiv.1902.04740openalex-snapshot
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
inferred← citeshttps://doi.org/10.5555/1109557.1109657openalex-snapshot
Query-efficient algorithms for polynomial interpolation over composites
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.