scientific article; zbMATH DE number 3943795
From MaRDI portal
Publication:3715098
zbMATH Open0588.03024MaRDI QIDQ3715098FDOQ3715098
Authors: Peter G. Hinman, Stathis Zachos
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
PSPACETuring machinesNPBPPpolynomial-time complexity classesbounded error probabilistic polynomial timepolynomially bounded quantifiersprobabilistic quantifiersquantifier- classes
Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Cited In (13)
- Probabilistic quantifiers and games
- A decisive characterization of BPP
- Title not available (Why is that?)
- Complexity classes of equivalence problems revisited
- A uniform approach to define complexity classes
- Does co-NP have short interactive proofs ?
- Error-bounded probabilistic computations between MA and AM
- Title not available (Why is that?)
- Restricted relativizations of probabilistic polynomial time
- Operational characterization of weight-based resource quantifiers via exclusion tasks in general probabilistic theories
- Probabilistic complexity classes and lowness
- Title not available (Why is that?)
- Title not available (Why is that?)
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 Q3715098)