On the public citation graph

Circuits constructed with MOD q gates cannot compute ?AND? in sublinear size

https://doi.org/10.1007/bf01263425
0 signed · 22 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/bf01375469openalex-snapshot
On modp transversals
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1016/0890-5401(90)90007-5openalex-snapshot
Non-uniform automata over groups
inferredcites →https://doi.org/10.1017/cbo9780511526633.010openalex-snapshot
Some Problems Involving Razborov-Smolensky Polynomials
inferredcites →https://doi.org/10.1109/fscs.1990.89584openalex-snapshot
On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
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/3-540-44849-7_27openalex-snapshot
Some Properties of MODm Circuits Computing Simple 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-319-30000-9_22openalex-snapshot
Using Duality in Circuit Complexity
inferred← citeshttps://doi.org/10.1007/bf01294257openalex-snapshot
Upper and lower bounds for some depth-3 circuit classes
inferred← citeshttps://doi.org/10.1007/s00037-010-0287-zopenalex-snapshot
A New Characterization of ACC0 and Probabilistic CC0
inferred← citeshttps://doi.org/10.1007/s00037-016-0146-7openalex-snapshot
Dual VP Classes
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104443openalex-snapshot
A topological approach to non-uniform complexity
inferred← citeshttps://doi.org/10.1109/ccc.2009.15openalex-snapshot
A New Characterization of ACC^0 and Probabilistic CC^0
inferred← citeshttps://doi.org/10.1109/ccc.2011.36openalex-snapshot
Non-uniform ACC Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1109/focs.2006.46openalex-snapshot
Lower bounds for circuits with MOD_m gates
inferred← citeshttps://doi.org/10.1109/focs.2009.17openalex-snapshot
Linear Systems over Composite Moduli
inferred← citeshttps://doi.org/10.1145/2559903openalex-snapshot
Nonuniform ACC Circuit Lower Bounds
inferred← citeshttps://doi.org/10.2168/lmcs-3(1:4)2007openalex-snapshot
Logic Meets Algebra: the Case of Regular Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1510.04849openalex-snapshot
Using Duality in Circuit Complexity
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.