Relationships among PL, \#L, and the determinant
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3934409 (Why is no real title available?)
- scientific article; zbMATH DE number 3967918 (Why is no real title available?)
- scientific article; zbMATH DE number 3723866 (Why is no real title available?)
- scientific article; zbMATH DE number 176871 (Why is no real title available?)
- scientific article; zbMATH DE number 3519671 (Why is no real title available?)
- scientific article; zbMATH DE number 1256722 (Why is no real title available?)
- scientific article; zbMATH DE number 1256731 (Why is no real title available?)
- #P-COMPLETENESS VIA MANY-ONE REDUCTIONS
- A comparison of polynomial time reducibilities
- A complexity theory for feasible closure properties
- A note on the permanent value problem
- A taxonomy of problems with fast parallel algorithms
- A very hard log-space counting class
- Adaptive logspace reducibility and parallel time
- An Optimal Parallel Algorithm for Formula Evaluation
- Complexity classes defined by counting quantifiers
- Computational Complexity of Probabilistic Turing Machines
- Depth reduction for noncommutative arithmetic circuits
- Deterministic simulation of tape-bounded probabilistic Turing machine transducers
- Gap-definable counting classes
- On computing the determinant in small parallel time using a small number of processors
- On tape-bounded probabilistic Turing machine acceptors
- On the Decomposability of $NC$ and $AC$
- On uniformity within \(NC^ 1\)
- PP is closed under intersection
- PP is closed under truth-table reductions
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- Relativization of questions about log space computability
- RelativizedNC
- Space-bounded hierarchies and probabilistic computations
- Structure and importance of logspace-MOD class
- The complexity of combinatorial problems with succinct input representation
- The complexity of computing the permanent
- The power of the middle bit of a \(\#\)P function
- Two Applications of Inductive Counting for Complementation Problems
- \(\text{RL}\subseteq \text{SC}\)
Cited in
(22)- The complexity of intersecting finite automata having few final states
- The Orbit Problem Is in the GapL Hierarchy
- Parameterised counting in logspace
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
- On the complexity of matrix rank and rigidity
- Space-bounded quantum complexity
- Non-commutative arithmetic circuits: depth reduction and size lower bounds
- Equivalence problems for circuits over sets of natural numbers
- The orbit problem is in the GapL hierarchy
- Counting classes and the fine structure between \(\mathrm{NC}^1\) and \(L\)
- Isolation, matching, and counting uniform and nonuniform upper bounds
- On the power of unambiguity in log-space
- Emptiness problems for integer circuits
- Emptiness problems for integer circuits
- Monomials, multilinearity and identity testing in simple read-restricted circuits
- A Logspace Algorithm for Partial 2-Tree Canonization
- The parallel complexity of graph canonization under abelian group action
- A note on closure properties of logspace MOD classes
- On expressive power of regular realizability problems
- Power of counting by nonuniform families of polynomial-size finite automata
- The Space Complexity of k-Tree Isomorphism
This page was built for publication: Relationships among $PL$, $\#L$, and the determinant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889814)
