Structure and importance of logspace-MOD class
From MaRDI portal
Recommendations
Cites work
- A taxonomy of problems with fast parallel algorithms
- A very hard log-space counting class
- Counting classes: Thresholds, parity, mods, and fewness
- Fast parallel matrix and GCD computations
- scientific article; zbMATH DE number 4209587 (Why is no real title available?)
- scientific article; zbMATH DE number 3984573 (Why is no real title available?)
- scientific article; zbMATH DE number 18628 (Why is no real title available?)
- Modified branching programs and their computational power
- Nondeterministic Space is Closed under Complementation
- On computing the determinant in small parallel time using a small number of processors
- Relative complexity of checking and evaluating
- Relativization of questions about log space computability
- The complexity of computing the permanent
- The method of forced enumeration for nondeterministic automata
- Two Applications of Inductive Counting for Complementation Problems
Cited in
(38)- Universal algebra and hardness results for constraint satisfaction problems
- Affine systems of equations and counting infinitary logic
- A very hard log-space counting class
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
- A note on closure properties of logspace MOD classes
- On the reducibility of sets inside NP to sets with low information content
- A note on logspace optimization
- On the power of unambiguity in log-space
- Isolation, matching, and counting uniform and nonuniform upper bounds
- On arithmetic branching programs
- On the complexity of matrix rank and rigidity
- Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
- NL-printable sets and nondeterministic Kolmogorov complexity
- The constraint satisfaction problem and universal algebra
- Complexity theory basics: NP and NL
- Solving linear equations parameterized by Hamming weight
- The Isomorphism Problem for k-Trees Is Complete for Logspace
- The complexity of intersecting finite automata having few final states
- On the Descriptive Complexity of Linear Algebra
- Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems
- The parallel complexity of graph canonization under abelian group action
- scientific article; zbMATH DE number 176518 (Why is no real title available?)
- Separating complexity classes related to bounded alternating ?-branching programs
- Tight space-noise tradeoffs in computing the ergodic measure
- Relationships among $PL$, $\#L$, and the determinant
- NL-printable sets and nondeterministic Kolmogorov complexity
- On the parameterized complexity of non-monotonic logics
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
- On the complexity of solving linear congruences and computing nullspaces modulo a constant
- ABE for circuits with constant-size secret keys and adaptive security
- A general framework for lattice-based ABE using evasive inner-product functional encryption
- On the acceptance power of regular languages
- Lower bounds for monotone span programs
- The complexity of circumscriptive inference in Post's lattice
- The isomorphism problem for \(k\)-trees is complete for logspace
- \textsc{ReachFewL} = \textsc{ReachUL}
- The complexity of propositional implication
This page was built for publication: Structure and importance of logspace-MOD class
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009813)
