Relativizations of Unambiguous and Random Polynomial Time Classes
From MaRDI portal
Publication:3750121
Recommendations
- scientific article; zbMATH DE number 4011940
- Restricted relativizations of probabilistic polynomial time
- An explicit separation of relativised random polynomial time and relativised deterministic polynomial time
- scientific article; zbMATH DE number 3885883
- scientific article; zbMATH DE number 3995648
- Refining Nondeterminism in Relativizations of Complexity Classes
- scientific article; zbMATH DE number 4106269
- On relativized exponential and probabilistic complexity classes
- scientific article; zbMATH DE number 227415
- Relativized generic classes P and NP
Cited in
(7)- Qualitative relativizations of complexity classes
- Oracles for structural properties: The isomorphism problem and public-key cryptography
- The isomorphism conjecture holds and one-way functions exist relative to an oracle
- Immunity and simplicity in relativizations of probabilistic complexity classes
- Simultaneous strong separations of probabilistic and unambiguous complexity classes
- Strong self-reducibility precludes strong immunity
- An explicit separation of relativised random polynomial time and relativised deterministic polynomial time
This page was built for publication: Relativizations of Unambiguous and Random Polynomial Time Classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750121)