On the public citation graph
A complex-number Fourier technique for lower bounds on the Mod-m degree
0 signed · 47 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.1036openalex-snapshot
The Power of the Middle Bit of a #P Function
inferredcites →https://doi.org/10.1007/3-540-56279-6_94openalex-snapshot
On probabilistic ACC circuits with an exact-threshold output gate
inferredcites →https://doi.org/10.1007/3-540-59042-0_63openalex-snapshot
Lower bounds for depth-three circuits with equals and mod-gates
inferredcites →https://doi.org/10.1007/978-1-4757-1779-2openalex-snapshot
A Classical Introduction to Modern Number Theory
inferredcites →https://doi.org/10.1007/bf00289117openalex-snapshot
The complexity of combinatorial problems with succinct input representation
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/bf01263421openalex-snapshot
Complex polynomials and circuit lower bounds for modular counting
inferredcites →https://doi.org/10.1016/0020-0190(91)90035-gopenalex-snapshot
An oracle separating ΘP from PPPH
inferredcites →https://doi.org/10.1016/0022-0000(93)90001-dopenalex-snapshot
Threshold circuits of bounded depth
inferredcites →https://doi.org/10.1016/0304-3975(90)90081-ropenalex-snapshot
Relations among mod-classes
inferredcites →https://doi.org/10.1016/0304-3975(92)90084-sopenalex-snapshot
Counting classes: thresholds, parity, mods, and fewness
inferredcites →https://doi.org/10.1016/s0304-3975(96)00019-9openalex-snapshot
On the computational power of depth-2 circuits with threshold and modulo gates
inferredcites →https://doi.org/10.1109/istcs.1995.377046openalex-snapshot
A lower bound on the mod 6 degree of the OR function
inferredcites →https://doi.org/10.1109/sct.1991.160241openalex-snapshot
Gap-definable counting classes
inferredcites →https://doi.org/10.1109/sct.1991.160282openalex-snapshot
Degree complexity of Boolean functions and its applications to relativized separations
inferredcites →https://doi.org/10.1109/sct.1993.336538openalex-snapshot
The polynomial method in circuit complexity
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1109/sfcs.1989.63538openalex-snapshot
A note on the power of threshold circuits
inferredcites →https://doi.org/10.1137/0220053openalex-snapshot
PP is as Hard as the Polynomial-Time Hierarchy
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/103418.103426openalex-snapshot
PP is closed under intersection
inferredcites →https://doi.org/10.1145/12130.12131openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
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-540-28629-5_24openalex-snapshot
Some Meet-in-the-Middle Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_44openalex-snapshot
Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_8openalex-snapshot
Weights of Exact Threshold Functions
inferred← citeshttps://doi.org/10.1007/s00224-022-10106-8openalex-snapshot
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
inferred← citeshttps://doi.org/10.1007/s00493-014-2367-1openalex-snapshot
Constructing Ramsey Graphs from Boolean Function Representations
inferred← citeshttps://doi.org/10.1007/s12095-014-0120-7openalex-snapshot
Characterization of robust immune symmetric boolean functions
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.01.003openalex-snapshot
The correlation between parity and quadratic polynomials mod3
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.1109/ccc.2002.1004341openalex-snapshot
The correlation between parity and quadratic polynomials mod 3
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959893openalex-snapshot
Lower bounds for polynomial calculus: non-binomial case
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/19m1276467openalex-snapshot
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem
inferred← citeshttps://doi.org/10.1145/3313276.3316339openalex-snapshot
A fixed-depth size-hierarchy theorem for AC 0 [⊕] via the coin problem
inferred← citeshttps://doi.org/10.1145/3675668openalex-snapshot
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds
inferred← citeshttps://doi.org/10.37236/10600openalex-snapshot
Covering Symmetric Sets of the Boolean Cube by Affine Hyperplanes
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.