Characterizations of reduction classes modulo oracle conditions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1929453
- Algebraic characterizations for reduction systems
- Satisfiability and synthesis modulo oracles
- Reduction modulo sim and universality
- Orthogonality and Boolean Algebras for Deduction Modulo
- Characterizing polynomial complexity classes by reducibilities
- On the power of generalized Mod-classes
- On the mod \(p\) reduction of orthogonal representations
- scientific article; zbMATH DE number 3918383
- Random Oracle Reducibility
Cites work
- A comparison of polynomial time reducibilities
- Bounded query machines: on NP and PSPACE
- Bounded query machines: on NP( ) and NPQUERY( )
- On languages specified by relative acceptance
- Positive Relativizations of Complexity Classes
- Reductions on NP and p-selective sets
- Relationships between nondeterministic and deterministic tape complexities
- Reset machines
- Rudimentary Predicates and Relative Computation
- Simple Representations of Certain Classes of Languages
- Time- and tape-bounded Turing acceptors and AFLs
Cited in
(4)
This page was built for publication: Characterizations of reduction classes modulo oracle conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763590)