On the public citation graph
Structure and importance of logspace-MOD-classes
0 signed · 49 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.1007/3-540-16486-3_85openalex-snapshot
The complexity of sparse sets in P
inferredcites →https://doi.org/10.1007/3-540-52282-4_31openalex-snapshot
Counting classes: Thresholds, parity, mods, and fewness
inferredcites →https://doi.org/10.1007/bf00299636openalex-snapshot
The method of forced enumeration for nondeterministic automata
inferredcites →https://doi.org/10.1007/bf01683260openalex-snapshot
Relativization of questions about log space computability
inferredcites →https://doi.org/10.1007/bfb0017563openalex-snapshot
Modified Branching Programs and Their Computational Power
inferredcites →https://doi.org/10.1007/bfb0028987openalex-snapshot
On the power of parity polynomial time
inferredcites →https://doi.org/10.1007/bfb0029607openalex-snapshot
Using inductive counting to simulate nondeterministic computation
inferredcites →https://doi.org/10.1007/bfb0029635openalex-snapshot
Characterizing unambiguous augmented pushdown automata by circuits
inferredcites →https://doi.org/10.1007/bfb0036487openalex-snapshot
Two remarks on the power of counting
inferredcites →https://doi.org/10.1016/0020-0190(76)90097-1openalex-snapshot
Relative complexity of checking and evaluating
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
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(92)90084-sopenalex-snapshot
Counting classes: thresholds, parity, mods, and fewness
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1109/sct.1988.5271openalex-snapshot
Two applications of complementation via inductive counting
inferredcites →https://doi.org/10.1109/sct.1990.113964openalex-snapshot
A very hard log space counting class
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation
inferredcites →https://doi.org/10.1137/0218038openalex-snapshot
Two Applications of Inductive Counting for Complementation Problems
inferredcites →https://doi.org/10.1145/12130.12164openalex-snapshot
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11780342_26openalex-snapshot
On Graph Isomorphism for Restricted Graph Classes
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_61openalex-snapshot
Unambiguity and fewness for logarithmic space
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_55openalex-snapshot
Circuits with monoidal gates
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_39openalex-snapshot
The Complexity of Solving Linear Equations over a Finite Ring
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_51openalex-snapshot
Hardness Results for Tournament Isomorphism and Automorphism
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_24openalex-snapshot
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_14openalex-snapshot
From Secrecy to Soundness: Efficient Verification via Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_39openalex-snapshot
Canonizing Hypergraphs under Abelian Group Action
inferred← citeshttps://doi.org/10.1007/bf01294594openalex-snapshot
Separating complexity classes related to bounded alternating ?-branching programs
inferred← citeshttps://doi.org/10.1007/s00037-009-0266-4openalex-snapshot
Space-Efficient Counting in Graphs on Surfaces
inferred← citeshttps://doi.org/10.1007/s00153-015-0435-xopenalex-snapshot
On the parameterized complexity of non-monotonic logics
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00032-ropenalex-snapshot
On the acceptance power of regular languages
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.06.015openalex-snapshot
The complexity of propositional implication
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00091-0openalex-snapshot
A note on closure properties of logspace MOD classes
inferred← citeshttps://doi.org/10.1017/jsl.2018.33openalex-snapshot
RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!
inferred← citeshttps://doi.org/10.1090/dimacs/039/15openalex-snapshot
Algebraic models of computation and interpolation for algebraic proof systems
inferred← citeshttps://doi.org/10.1093/logcom/exr012openalex-snapshot
Complexity Classifications for Propositional Abduction in Post's Framework
inferred← citeshttps://doi.org/10.1109/ccc.2010.21openalex-snapshot
On the Matching Problem for Special Graph Classes
inferred← citeshttps://doi.org/10.1109/lics.2015.51openalex-snapshot
Locally Finite Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1109/sct.1991.160269openalex-snapshot
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
inferred← citeshttps://doi.org/10.1109/sct.1992.215384openalex-snapshot
Circuits, matrices, and nonassociative computation
inferred← citeshttps://doi.org/10.3233/fi-1996-253408openalex-snapshot
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7381openalex-snapshot
On computation with 'probabilities' modulo k
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.