On the public citation graph
Structure and importance of logspace-MOD class
0 signed · 120 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/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/s0019-9958(82)90766-5openalex-snapshot
Fast parallel matrix and GCD computations
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.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.1006/inco.1996.0071openalex-snapshot
Logspace and Logtime Leaf Languages
inferred← citeshttps://doi.org/10.1006/jcss.1999.1646openalex-snapshot
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds
inferred← citeshttps://doi.org/10.1006/jcss.1999.1648openalex-snapshot
On Arithmetic Branching Programs
inferred← citeshttps://doi.org/10.1007/11672142_31openalex-snapshot
On Hypergraph and Graph Isomorphism with Bounded Color Classes
inferred← citeshttps://doi.org/10.1007/11780342_26openalex-snapshot
On Graph Isomorphism for Restricted Graph Classes
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_16openalex-snapshot
The Complexity of Tensor Circuit Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_55openalex-snapshot
Circuits with monoidal gates
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_6openalex-snapshot
On the Enumerability of the Determinant and the Rank
inferred← citeshttps://doi.org/10.1007/978-3-031-22318-1_24openalex-snapshot
ABE for Circuits with Constant-Size Secret Keys and Adaptive Security
inferred← citeshttps://doi.org/10.1007/978-3-031-58723-8_15openalex-snapshot
A General Framework for Lattice-Based ABE Using Evasive Inner-Product Functional Encryption
inferred← citeshttps://doi.org/10.1007/978-3-319-05446-9_1openalex-snapshot
Complexity Theory Basics: NP and NL
inferred← citeshttps://doi.org/10.1007/978-3-540-30598-9_18openalex-snapshot
On the Size of Monotone Span Programs
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-69937-8_2openalex-snapshot
On the Descriptive Complexity of Linear Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_25openalex-snapshot
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_49openalex-snapshot
Affine Systems of Equations and Counting Infinitary Logic
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-74510-5_28openalex-snapshot
On the Complexity of Matrix Rank and Rigidity
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-03816-7_46openalex-snapshot
The Isomorphism Problem for k-Trees Is Complete for Logspace
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_25openalex-snapshot
The Complexity of Circumscriptive Inference in Post’s Lattice
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_21openalex-snapshot
Formal Theories for Linear Algebra
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/978-3-642-30642-6_4openalex-snapshot
The Complexity of Intersecting Finite Automata Having Few Final States
inferred← citeshttps://doi.org/10.1007/bf01202040openalex-snapshot
Lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1007/bf01294594openalex-snapshot
Separating complexity classes related to bounded alternating ?-branching programs
inferred← citeshttps://doi.org/10.1007/s00037-000-0170-4openalex-snapshot
The complexity of tensor calculus
inferred← citeshttps://doi.org/10.1007/s00037-007-0222-0openalex-snapshot
The Complexity of Tensor Circuit Evaluation
inferred← citeshttps://doi.org/10.1007/s00037-009-0266-4openalex-snapshot
Space-Efficient Counting in Graphs on Surfaces
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.1007/s00037-012-0047-3openalex-snapshot
On the power of unambiguity in log-space
inferred← citeshttps://doi.org/10.1007/s00037-014-0089-9openalex-snapshot
The complexity of intersecting finite automata having few final states
inferred← citeshttps://doi.org/10.1007/s000370100001openalex-snapshot
A characterization of span program size and improved lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1007/s00153-015-0435-xopenalex-snapshot
On the parameterized complexity of non-monotonic logics
inferred← citeshttps://doi.org/10.1007/s00224-003-1091-9openalex-snapshot
The (Non)Enumerability of the Determinant and the Rank
inferred← citeshttps://doi.org/10.1007/s00224-008-9136-8openalex-snapshot
On the Complexity of Matrix Rank and Rigidity
inferred← citeshttps://doi.org/10.1007/s00224-010-9311-6openalex-snapshot
The Complexity of Circumscriptive Inference in Post’s Lattice
inferred← citeshttps://doi.org/10.1007/s00453-013-9805-0openalex-snapshot
The Parallel Complexity of Graph Canonization Under Abelian Group Action
inferred← citeshttps://doi.org/10.1007/s00453-015-0098-3openalex-snapshot
Solving Linear Equations Parameterized by Hamming Weight
inferred← citeshttps://doi.org/10.1007/s004930050058openalex-snapshot
Superpolynomial Lower Bounds for Monotone Span Programs
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.cam.2004.03.003openalex-snapshot
The arbitrary order implicit multistep schemes of exponential fitting and their applications
inferred← citeshttps://doi.org/10.1016/j.ic.2012.04.002openalex-snapshot
The isomorphism problem for k-trees is complete for logspace
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.06.015openalex-snapshot
The complexity of propositional implication
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.03.003openalex-snapshot
On the reducibility of sets inside NP to sets with low information content
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.005openalex-snapshot
NL-printable sets and nondeterministic Kolmogorov complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.049openalex-snapshot
Affine systems of equations and counting infinitary logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.035openalex-snapshot
Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs
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.1016/s0304-3975(98)00170-4openalex-snapshot
Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80838-7openalex-snapshot
NL-printable sets and Nondeterministic Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1017/bsl.2015.25openalex-snapshot
THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
inferred← citeshttps://doi.org/10.1017/jsl.2018.33openalex-snapshot
RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!
inferred← citeshttps://doi.org/10.1051/ita/1996300100011openalex-snapshot
Relationships among $PL$, $\#L$, and the determinant
inferred← citeshttps://doi.org/10.1070/sm8884openalex-snapshot
Tight space-noise tradeoffs in computing the ergodic measure
inferred← citeshttps://doi.org/10.1093/logcom/exr012openalex-snapshot
Complexity Classifications for Propositional Abduction in Post's Framework
inferred← citeshttps://doi.org/10.1103/physrevlett.115.098701openalex-snapshot
Space-Bounded Church-Turing Thesis and Computational Tractability of Closed Systems
inferred← citeshttps://doi.org/10.1109/ccc.1998.694592openalex-snapshot
On arithmetic branching programs
inferred← citeshttps://doi.org/10.1109/ccc.1998.694594openalex-snapshot
Isolation, matching, and counting
inferred← citeshttps://doi.org/10.1109/ccc.2001.933886openalex-snapshot
On the power of nonlinear secret-sharing
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/ccc.2005.7openalex-snapshot
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy
inferred← citeshttps://doi.org/10.1109/istcs.1997.595170openalex-snapshot
Private simultaneous messages protocols with applications
inferred← citeshttps://doi.org/10.1109/sct.1992.215384openalex-snapshot
Circuits, matrices, and nonassociative computation
inferred← citeshttps://doi.org/10.1109/sct.1994.315797openalex-snapshot
Relationships among PL, #L, and the determinant
inferred← citeshttps://doi.org/10.1109/sct.1994.315799openalex-snapshot
Logspace and logtime leaf languages
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492491openalex-snapshot
Sparse P-hard sets yield space-efficient algorithms
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492669openalex-snapshot
Lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892080openalex-snapshot
On the hardness of graph isomorphism
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238216openalex-snapshot
Separating the power of monotone span programs over different fields
inferred← citeshttps://doi.org/10.1137/20m1327550openalex-snapshot
Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm
inferred← citeshttps://doi.org/10.1137/s009753970241096xopenalex-snapshot
On the Hardness of Graph Isomorphism
inferred← citeshttps://doi.org/10.1137/s0097539704444038openalex-snapshot
Separating the Power of Monotone Span Programs over Different Fields
inferred← citeshttps://doi.org/10.1137/s0097539793249530openalex-snapshot
Finite Monoids: From Word to Circuit Evaluation
inferred← citeshttps://doi.org/10.1137/s0895480102412868openalex-snapshot
On the Power of Nonlinear Secret-Sharing
inferred← citeshttps://doi.org/10.1142/s0218196716500600openalex-snapshot
Complexity and polymorphisms for digraph constraint problems under some basic constructions
inferred← citeshttps://doi.org/10.1145/2159531.2159539openalex-snapshot
The Complexity of Reasoning for Fragments of Autoepistemic Logic
inferred← citeshttps://doi.org/10.1145/237814.238010openalex-snapshot
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.1145/276698.276855openalex-snapshot
A characterization of span program size and improved lower bounds for monotone span programs
inferred← citeshttps://doi.org/10.18452/16335openalex-snapshot
The structure of graphs and new logics for the characterization of Polynomial Time
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:25)2012openalex-snapshot
Formal Theories for Linear Algebra
inferred← citeshttps://doi.org/10.22331/q-2023-08-09-1079openalex-snapshot
Code-routing: a new attack on position verification
inferred← citeshttps://doi.org/10.22331/q-2024-06-27-1387openalex-snapshot
Relating non-local quantum computation to information theoretic cryptography
inferred← citeshttps://doi.org/10.26421/qic13.1-2-6openalex-snapshot
A linearized stabilizer formalism for systems of finite dimension
inferred← citeshttps://doi.org/10.3233/fi-2012-621openalex-snapshot
Unambiguous Functions in Logarithmic Space
inferred← citeshttps://doi.org/10.4213/sm8884openalex-snapshot
Точный баланс между объемом памяти и шумом при вычислении эргодических мер
inferred← citeshttps://doi.org/10.48550/arxiv.0912.3134openalex-snapshot
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1001.1960openalex-snapshot
Formal Theories for Logspace Counting
inferred← citeshttps://doi.org/10.48550/arxiv.1005.1425openalex-snapshot
Quantum Complexity: restrictions on algorithms and architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1006.4923openalex-snapshot
Complexity Classifications for Propositional Abduction in Post's Framework
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7381openalex-snapshot
On computation with 'probabilities' modulo k
inferred← citeshttps://doi.org/10.48550/arxiv.2101.08381openalex-snapshot
Quantum Constraint Problems can be complete for $\mathsf{BQP}$, $\mathsf{QCMA}$, and more
inferred← citeshttps://doi.org/10.7146/brics.v1i46.21596openalex-snapshot
Lower Bounds for Monotone Span Programs
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.