Lower space bounds for randomized computation (Q4632458): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rūsiņš Freivalds / rank
 
Normal rank
Property / author
 
Property / author: Marek Karpinski / rank
 
Normal rank
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/3-540-58201-0_100 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091845976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3355230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers I / 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: Q3326840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for probabilistic algorithms for finite state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to randomized algorithms / 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: Q3819053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized versus deterministic computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3262596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating a probability using finite memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A context-free language which is not acceptable by a probabilistic automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-negative matrices and Markov chains. 2nd ed / rank
 
Normal rank

Latest revision as of 01:54, 19 July 2024

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

    Statements

    Lower space bounds for randomized computation (English)
    0 references
    29 April 2019
    0 references
    Markov chain
    0 references
    Monte Carlo Turing machine
    0 references
    word probability
    0 references
    input word
    0 references
    probabilistic Turing machines
    0 references
    0 references
    0 references

    Identifiers