On the public citation graph

On modp transversals

https://doi.org/10.1007/bf01375469
0 signed · 18 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01137685openalex-snapshot
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
inferredcites →https://doi.org/10.1016/0890-5401(90)90007-5openalex-snapshot
Non-uniform automata over groups
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50019-9openalex-snapshot
The Complexity of Finite Functions
inferredcites →https://doi.org/10.1137/0150051openalex-snapshot
The Uncertainty Principle on Groups
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.1006/jcss.1995.1069openalex-snapshot
Separating the Communication Complexities of MOD m and MOD p Circuits
inferred← citeshttps://doi.org/10.1007/3-540-44849-7_27openalex-snapshot
Some Properties of MODm Circuits Computing Simple Functions
inferred← citeshttps://doi.org/10.1007/bf01263425openalex-snapshot
Circuits constructed with MOD q gates cannot compute ?AND? in sublinear size
inferred← citeshttps://doi.org/10.1007/bf01305949openalex-snapshot
Spectral properties of threshold functions
inferred← citeshttps://doi.org/10.1007/bfb0055055openalex-snapshot
A degree-decreasing Lemma for (MOD q, MOD p) circuits
inferred← citeshttps://doi.org/10.1016/s0195-6698(05)80019-8openalex-snapshot
An uncertainty inequality for groups of order pq
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267764openalex-snapshot
Separating the communication complexities of MOD m and MOD p circuits
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743459openalex-snapshot
Lower bounds for (MOD p-MOD m) circuits
inferred← citeshttps://doi.org/10.1109/tit.2019.2906301openalex-snapshot
The Shift Bound for Abelian Codes and Generalizations of the Donoho-Stark Uncertainty Principle
inferred← citeshttps://doi.org/10.1137/s009753970342465xopenalex-snapshot
Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications
inferred← citeshttps://doi.org/10.1137/s0097539798340850openalex-snapshot
Lower Bounds for (MOD p - MOD m ) Circuits
inferred← citeshttps://doi.org/10.46298/dmtcs.289openalex-snapshot
A Degree-Decreasing Lemma for (MOD_q-MOD_p) Circuits
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.