scientific article; zbMATH DE number 4011940
From MaRDI portal
Publication:3761699
Recommendations
Cited in
(49)- Qualitative relativizations of complexity classes
- Relativized circuit complexity
- Some hierarchies of relativized time-bounded complexity classes
- Complexity classes without machines: on complete languages for UP
- On the relative complexity of hard problems for complexity classes without complete problems
- Determining the levels of some special complexity classes of sets in the Kleene arithmetical hierarchy
- A general method to construct oracles realizing given relationships between complexity classes
- Easy sets and hard certificate schemes
- Relativizing relativized computations
- Complexity classes as mathematical axioms. II
- Refining Nondeterminism in Relativizations of Complexity Classes
- On low for speed oracles
- scientific article; zbMATH DE number 3868613 (Why is no real title available?)
- Positive Relativizations of Complexity Classes
- On relativized nondeterministic polynomial-time bounded computations
- Relativizations comparing NP and exponential time
- On Relativized Polynomial and Exponential Computations
- Some Relations between Classes of Low Computational Complexity
- Simplicity, Relativizations and Nondeterminism
- scientific article; zbMATH DE number 3926243 (Why is no real title available?)
- scientific article; zbMATH DE number 3926244 (Why is no real title available?)
- On Restricting the Size of Oracles Compared with Restricting Access to Oracles
- scientific article; zbMATH DE number 3940729 (Why is no real title available?)
- scientific article; zbMATH DE number 3943795 (Why is no real title available?)
- Quantitative Relativizations of Complexity Classes
- scientific article; zbMATH DE number 3974294 (Why is no real title available?)
- Relativizations of Unambiguous and Random Polynomial Time Classes
- On relativized exponential and probabilistic complexity classes
- On relativizations with restricted number of accesses to the oracle set
- scientific article; zbMATH DE number 4074484 (Why is no real title available?)
- scientific article; zbMATH DE number 4077187 (Why is no real title available?)
- Immunity, simplicity, probabilistic complexity classes and relativizations
- scientific article; zbMATH DE number 4099277 (Why is no real title available?)
- scientific article; zbMATH DE number 4108743 (Why is no real title available?)
- On Tally Relativizations of $BP$-Complexity Classes
- Oracles for Deterministic Versus Alternating Classes
- scientific article; zbMATH DE number 500314 (Why is no real title available?)
- Capturing Relativized Complexity Classes without Order
- scientific article; zbMATH DE number 1775405 (Why is no real title available?)
- Beyond \(\mathbf{P}^{\mathbf{NP}}=\mathbf{NEXP}\)
- On the cutting edge of relativization: the resource bounded injury method
- Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
- scientific article; zbMATH DE number 4114605 (Why is no real title available?)
- On the Relations Between Discrete and Continuous Complexity Theory
- On relativizations of the P =? NP question for several structures
- The structure of relativized P and NP questions
- Logics capturing relativized complexity classes uniformly
- Oracle-dependent properties of the lattice of NP sets
- Structural properties of oracle classes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3761699)
