Probabilistic quantifiers and games
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3943795 (Why is no real title available?)
- scientific article; zbMATH DE number 4027449 (Why is no real title available?)
- scientific article; zbMATH DE number 4057011 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 619533 (Why is no real title available?)
- scientific article; zbMATH DE number 3992936 (Why is no real title available?)
- A Fast Monte-Carlo Test for Primality
- A decisive characterization of BPP
- A second step toward the polynomial hierarchy
- BPP and the polynomial hierarchy
- Complete sets and the polynomial-time hierarchy
- Computational Complexity of Probabilistic Turing Machines
- Does co-NP have short interactive proofs ?
- On counting problems and the polynomial-time hierarchy
- On relativized exponential and probabilistic complexity classes
- Probabilistic algorithm for testing primality
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Relativized Questions Involving Probabilistic Algorithms
- Robustness of probabilistic computational complexity classes under definitional perturbations
- Some observations on the probabilistic algorithms and NP-hard problems
- The complexity of facets (and some facets of complexity)
- The knowledge complexity of interactive proof-systems
- The polynomial-time hierarchy
Cited in
(28)- scientific article; zbMATH DE number 2102762 (Why is no real title available?)
- Structural analysis of the complexity of inverse functions
- The Complexity of Aggregates over Extractions by Regular Expressions
- Towards logical foundations for probabilistic computation
- scientific article; zbMATH DE number 3943795 (Why is no real title available?)
- Transducing Markov sequences
- scientific article; zbMATH DE number 5542577 (Why is no real title available?)
- On closure properties of bounded two-sided error complexity classes
- Complexity classes of equivalence problems revisited
- On the probabilistic closure of the loose unambiguous hierarchy
- scientific article; zbMATH DE number 4027449 (Why is no real title available?)
- A uniform approach to define complexity classes
- scientific article; zbMATH DE number 2089956 (Why is no real title available?)
- scientific article; zbMATH DE number 6787702 (Why is no real title available?)
- Game-Based Probabilistic Predicate Abstraction in PRISM
- scientific article; zbMATH DE number 7445154 (Why is no real title available?)
- Product logic and probabilistic Ulam games
- ON HIGHER ARTHUR-MERLIN CLASSES
- Two queries
- Quantum and classical complexity classes: Separations, collapses, and closure properties
- On counting propositional logic and Wagner's hierarchy
- Fault-tolerance and complexity (extended abstract)
- Curry and Howard meet Borel
- A probabilistic representation of exact games on image-algebras
- Polynomial time samplable distributions
- scientific article; zbMATH DE number 4057011 (Why is no real title available?)
- On the acceptance power of regular languages
- scientific article; zbMATH DE number 6130976 (Why is no real title available?)
This page was built for publication: Probabilistic quantifiers and games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112019)
