Lower time bounds for randomized computation (Q4645177): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-60084-1_73 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4205776748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4116394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower space bounds for randomized computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Transfer under Different Sets of Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976039 / 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: On randomized versus deterministic computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023358 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:27, 17 July 2024

scientific article; zbMATH DE number 6999431
Language Label Description Also known as
English
Lower time bounds for randomized computation
scientific article; zbMATH DE number 6999431

    Statements

    Lower time bounds for randomized computation (English)
    0 references
    10 January 2019
    0 references
    Turing machine
    0 references
    Kolmogorov complexity
    0 references
    input word
    0 references
    input tape
    0 references
    probabilistic machine
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references