RelativizedNC
From MaRDI portal
Publication:3763591
DOI10.1007/BF01692056zbMATH Open0627.68043OpenAlexW4238805097MaRDI QIDQ3763591FDOQ3763591
Authors: Christopher B. Wilson 
Publication date: 1987
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01692056
Recommendations
oraclesrelativized complexity classesrelativized depth for circuit familiesrelativized NCuniform families of relativized circuits
Cites Work
- Qualitative relativizations of complexity classes
- Space-bounded hierarchies and probabilistic computations
- On uniform circuit complexity
- Relationships between nondeterministic and deterministic tape complexities
- A taxonomy of problems with fast parallel algorithms
- Relativization of questions about log space computability
- The polynomial-time hierarchy
- Relativized circuit complexity
- On Relating Time and Space to Size and Depth
- A Boolean function requiring 3n network size
- Quantitative Relativizations of Complexity Classes
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- The network complexity and the Turing machine complexity of finite functions
- A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
- Title not available (Why is that?)
- Limitations on Separating Nondeterministic Complexity Classes
Cited In (19)
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
- On NC-real complexity classes for additive circuits and their relations with NC
- Title not available (Why is that?)
- Relativized logspace and generalized quantifiers over finite ordered structures
- On adaptive DLOGTIME and POLYLOGTIME reductions
- A measure of relativized space which is faithful with respect to depth
- Characterizations of some complexity classes between \(\Theta_2^{\mathrm{P}}\) and \(\Delta_2^{\mathrm{P}}\)
- Positive relativizations for log space computability
- Equivalence of NC\(^ k\) and AC\(^{k-1}\) closures of NP and other classes
- Relativized circuit complexity
- On parallel hierarchies and R ki
- Relationships among $PL$, $\#L$, and the determinant
- Adaptive logspace reducibility and parallel time
- The complexity class θp2: Recent results and applications in AI and modal logic
- Circuit depth relative to a random oracle
- Parallel computation and the NC hierarchy relativized
- Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
- Separating NC along the \(\delta\) axis
- On parallel hierarchies and \(R_k^i\)
This page was built for publication: RelativizedNC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763591)
