A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle (Q4686644): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-46376-6_3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2547032772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational power of neural networks: a characterization in terms of Kolmogorov complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity with experiments as oracles. II. Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity with experiments as oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles and Advice as Measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computations with oracles that measure vanishing quantities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits to measurement in experiments governed by algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Physical oracles: the Turing machine and the Wheatstone bridge / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of models of a physical oracle on computational power / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles that measure thresholds: the Turing machine and the broken balance / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ANALOGUE-DIGITAL CHURCH-TURING THESIS / rank
 
Normal rank
Property / cites work
 
Property / cites work: THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random orders and gambler's ruin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomputability at the foundations of physics (A study in the philosophy of science) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertainty in Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum walks: a comprehensive review / rank
 
Normal rank

Latest revision as of 17:44, 16 July 2024

scientific article; zbMATH DE number 6946906
Language Label Description Also known as
English
A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle
scientific article; zbMATH DE number 6946906

    Statements

    A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2018
    0 references
    random walk
    0 references
    polynomial time
    0 references
    Turing machine
    0 references
    advice function
    0 references
    oracle query
    0 references

    Identifiers