On tape-bounded probabilistic Turing machine acceptors (Q1158756): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/0304-3975(81)90032-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974216994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the power of vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Turing Machines and Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139697 / rank
 
Normal rank

Latest revision as of 14:21, 13 June 2024

scientific article
Language Label Description Also known as
English
On tape-bounded probabilistic Turing machine acceptors
scientific article

    Statements