Pages that link to "Item:Q4009813"

The following pages link to Structure and importance of logspace-MOD class (Q4009813):

Displaying 33 items.

• Solving linear equations parameterized by Hamming weight (Q309792) (← links)
• The complexity of intersecting finite automata having few final states (Q347114) (← links)
• The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
• On the parameterized complexity of non-monotonic logics (Q494658) (← links)
• On the acceptance power of regular languages (Q672323) (← links)
• Lower bounds for monotone span programs (Q677989) (← links)
• The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
• The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
• \textsc{ReachFewL} = \textsc{ReachUL} (Q744612) (← links)
• The complexity of propositional implication (Q989577) (← links)
• Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
• Affine systems of equations and counting infinitary logic (Q1014638) (← links)
• Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
• A note on closure properties of logspace MOD classes (Q1583060) (← links)
• On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
• On the power of unambiguity in log-space (Q1926109) (← links)
• Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
• On arithmetic branching programs (Q1961372) (← links)
• On the complexity of matrix rank and rigidity (Q2268340) (← links)
• Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs (Q2344774) (← links)
• NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
• The constraint satisfaction problem and universal algebra (Q2795309) (← links)
• Complexity Theory Basics: NP and NL (Q2821692) (← links)
• The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
• On the Descriptive Complexity of Linear Algebra (Q3511442) (← links)
• Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems (Q3599136) (← links)
• Separating complexity classes related to bounded alternating ?-branching programs (Q4327378) (← links)
• Tight space-noise tradeoffs in computing the ergodic measure (Q4610200) (← links)
• Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
• NL-printable sets and Nondeterministic Kolmogorov Complexity (Q4924524) (← links)
• (Q4993594) (← links)
• Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334) (← links)
• A general framework for lattice-based ABE using evasive inner-product functional encryption (Q6636517) (← links)