On the public citation graph
Separating the Communication Complexities of MOD m and MOD p Circuits
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.1006/inco.1994.1051openalex-snapshot
The Bns Lower-Bound for Multiparty Protocols Is Nearly Optimal
inferredcites →https://doi.org/10.1007/pl00001592openalex-snapshot
Circuits and multi-party protocols
inferredcites →https://doi.org/10.1016/0890-5401(90)90007-5openalex-snapshot
Non-uniform automata over groups
inferredcites →https://doi.org/10.1109/fscs.1990.89582openalex-snapshot
On the power of small-depth threshold circuits
inferredcites →https://doi.org/10.1109/sfcs.1989.63535openalex-snapshot
Probabilistic communication complexity of Boolean relations
inferredcites →https://doi.org/10.1137/s0097539792233907openalex-snapshot
A Uniform Circuit Lower Bound for the Permanent
inferredcites →https://doi.org/10.1145/100216.100252openalex-snapshot
Functions with bounded symmetric communication complexity and circuits with mod m gates
inferredcites →https://doi.org/10.1145/100216.100253openalex-snapshot
Monotone circuits for matching require linear depth
inferredcites →https://doi.org/10.1145/129712.129756openalex-snapshot
Representing Boolean functions as polynomials modulo composite numbers
inferredcites →https://doi.org/10.1145/195058.195108openalex-snapshot
A weight-size trade-off for circuits with MOD m gates
inferredcites →https://doi.org/10.1145/28395.28404openalex-snapshot
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
inferredcites →https://doi.org/10.1145/62212.62265openalex-snapshot
Monotone circuits for connectivity require super-logarithmic depth
inferredcites →https://doi.org/10.1145/73007.73008openalex-snapshot
Multiparty protocols and logspace-hard pseudorandom sequences
inferredcites →https://doi.org/10.1145/800135.804414openalex-snapshot
Some complexity questions related to distributive computing(Preliminary Report)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_147openalex-snapshot
Harmonic analysis, real approximation, and the communication complexity of Boolean functions
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_33openalex-snapshot
Circuit complexity before the dawn of the new millennium
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_2openalex-snapshot
The NOF Multiparty Communication Complexity of Composed Functions
inferred← citeshttps://doi.org/10.1007/bfb0055055openalex-snapshot
A degree-decreasing Lemma for (MOD q, MOD p) circuits
inferred← citeshttps://doi.org/10.1007/pl00009265openalex-snapshot
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions
inferred← citeshttps://doi.org/10.1007/s00037-013-0078-4openalex-snapshot
The NOF Multiparty Communication Complexity of Composed Functions
inferred← citeshttps://doi.org/10.1007/s004930100009openalex-snapshot
The Cost of the Missing Bit: Communication Complexity with Help
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00093-3openalex-snapshot
A lower bound for depth-3 circuits with MOD m gates
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00204-3openalex-snapshot
Constructing set systems with prescribed intersection sizes
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00290-3openalex-snapshot
On the power of circuits with gates of low L1 norms
inferred← citeshttps://doi.org/10.1109/ccc.2007.15openalex-snapshot
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
inferred← citeshttps://doi.org/10.1137/s009753970342465xopenalex-snapshot
Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications
inferred← citeshttps://doi.org/10.14569/ijacsa.2018.090513openalex-snapshot
BLOT: A Novel Phase Privacy Preserving Framework for Location-Based Services
inferred← citeshttps://doi.org/10.1561/0400000033openalex-snapshot
On the Power of Small-Depth Computation
inferred← citeshttps://doi.org/10.1561/9781601983015openalex-snapshot
On the Power of Small-Depth Computation
inferred← citeshttps://doi.org/10.3390/math11224651openalex-snapshot
A Note on the LogRank Conjecture in Communication Complexity
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.546openalex-snapshot
Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
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.