On adaptive DLOGTIME and POLYLOGTIME reductions
From MaRDI portal
Publication:672322
DOI10.1016/0304-3975(95)00033-SzbMath0873.68069MaRDI QIDQ672322
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- On adaptive DLOGTIME and POLYLOGTIME reductions
- Computing functions with parallel queries to NP
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- On uniform circuit complexity
- A very hard log-space counting class
- The polynomial-time hierarchy
- On uniformity within \(NC^ 1\)
- On the Decomposability of $NC$ and $AC$
- Parity, circuits, and the polynomial-time hierarchy
- Constant Depth Reducibility
- Bounded Query Classes
- A taxonomy of problems with fast parallel algorithms
- RelativizedNC
- Two Applications of Inductive Counting for Complementation Problems
- Alternation
- An Optimal Parallel Algorithm for Formula Evaluation
- On the Tape Complexity of Deterministic Context-Free Languages
- Adaptive logspace reducibility and parallel time
- Characterizations of some complexity classes between Θ2p and Δ2p
This page was built for publication: On adaptive DLOGTIME and POLYLOGTIME reductions
