On randomized versus deterministic computation (Q4630263): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3355230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit-size lower bounds and non-reducibility to sparse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized Questions Involving Probabilistic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximation Algorithms for # P / rank
 
Normal rank

Latest revision as of 23:41, 18 July 2024

scientific article; zbMATH DE number 7045116
Language Label Description Also known as
English
On randomized versus deterministic computation
scientific article; zbMATH DE number 7045116

    Statements

    On randomized versus deterministic computation (English)
    0 references
    0 references
    0 references
    29 March 2019
    0 references
    random oracle
    0 references
    deterministic time
    0 references
    oracle query
    0 references
    polynomial hierarchy
    0 references
    oracle machine
    0 references

    Identifiers