On the public citation graph
On the power of generalized Mod-classes
0 signed · 39 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/bf00289117openalex-snapshot
The complexity of combinatorial problems with succinct input representation
inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1016/0020-0190(93)90102-fopenalex-snapshot
On random reductions from sparse sets to tally sets
inferredcites →https://doi.org/10.1016/0304-3975(75)90016-xopenalex-snapshot
A comparison of polynomial time reducibilities
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(83)90004-xopenalex-snapshot
A natural encoding scheme proved probabilistic polynomial complete
inferredcites →https://doi.org/10.1016/0304-3975(86)90165-9openalex-snapshot
On the construction of parallel computers from various bases of boolean functions
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/s0022-0000(05)80024-8openalex-snapshot
Gap-definable counting classes
inferredcites →https://doi.org/10.1109/fscs.1990.89583openalex-snapshot
ON ACC and threshold circuits
inferredcites →https://doi.org/10.1109/sct.1991.160241openalex-snapshot
Gap-definable counting classes
inferredcites →https://doi.org/10.1109/sct.1991.160268openalex-snapshot
Connections between the complexity of unique satisfiability and the threshold behavior of randomized reductions
inferredcites →https://doi.org/10.1109/sct.1993.336524openalex-snapshot
Relativized limitations of left set technique and closure classes of sparse sets
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/0217056openalex-snapshot
On Sets Truth-Table Reducible to Sparse Sets
inferredcites →https://doi.org/10.1137/0220053openalex-snapshot
PP is as Hard as the Polynomial-Time Hierarchy
inferredcites →https://doi.org/10.1137/0221034openalex-snapshot
Relating Equivalence and Reducibility to Sparse Sets
inferredcites →https://doi.org/10.1145/116825.116858openalex-snapshot
Complexity classes defined by counting quantifiers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4112141openalex-extracted
A Combinatorial Property of ♯L Assuming Nl = Ul and its Implications for Modl
inferred← citeshttps://doi.org/10.1006/jcss.1995.1036openalex-snapshot
The Power of the Middle Bit of a #P Function
inferred← citeshttps://doi.org/10.1007/978-3-642-60322-8_20openalex-snapshot
The BP-Operator and the Power of Counting Classes
inferred← citeshttps://doi.org/10.1007/bfb0055799openalex-snapshot
Average-case intractability vs. worst-case intractability
inferred← citeshttps://doi.org/10.1007/s00037-009-0280-6openalex-snapshot
Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00026-9openalex-snapshot
A note on Mod and generalised Mod classes
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.03.002openalex-snapshot
On relations between counting communication complexity classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115572openalex-snapshot
Foundations of block-parallel automata networks
inferred← citeshttps://doi.org/10.1109/ccc.2004.1openalex-snapshot
Abelian permutation group problems and logspace counting classes
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313844openalex-snapshot
Abelian permutation group problems and logspace counting classes
inferred← citeshttps://doi.org/10.1109/sct.1993.336538openalex-snapshot
The polynomial method in circuit complexity
inferred← citeshttps://doi.org/10.1109/sct.1995.514863openalex-snapshot
On the structure of low sets [complexity classes]
inferred← citeshttps://doi.org/10.1109/sct.1995.514868openalex-snapshot
On the power of number-theoretic operations with respect to counting
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.