Adaptive logspace reducibility and parallel time
From MaRDI portal
Recommendations
Cites work
- A comparison of polynomial time reducibilities
- A taxonomy of problems with fast parallel algorithms
- A very hard log-space counting class
- Bounded Query Classes
- Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
- scientific article; zbMATH DE number 4088936 (Why is no real title available?)
- scientific article; zbMATH DE number 45125 (Why is no real title available?)
- scientific article; zbMATH DE number 46423 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- On Relating Time and Space to Size and Depth
- On similarity and duality of computation (I)
- On the Decomposability of NC and AC
- On uniform circuit complexity
- On uniformity within \(NC^ 1\)
- Relativization of questions about log space computability
- RelativizedNC
- Two Applications of Inductive Counting for Complementation Problems
Cited in
(9)- Characterizing parallel hierarchies by reducibilities
- A note on closure properties of logspace MOD classes
- A note on logspace optimization
- On expressive power of regular realizability problems
- Equivalence problems for circuits over sets of natural numbers
- Relationships among $PL$, $\#L$, and the determinant
- Reductions to Graph Isomorphism
- On adaptive DLOGTIME and POLYLOGTIME reductions
- Reductions to graph isomorphism
This page was built for publication: Adaptive logspace reducibility and parallel time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327383)
