Computational complexity of random access stored program machines (Q5627619): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Random-Access Stored-Program Machines, an Approach to Programming Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of One-Tape Turing Machine Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tape-reversal bounded Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real time computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of computable functions defined by bounds on computation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01694180 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014637829 / rank
 
Normal rank

Latest revision as of 10:34, 30 July 2024

scientific article; zbMATH DE number 3352761
Language Label Description Also known as
English
Computational complexity of random access stored program machines
scientific article; zbMATH DE number 3352761

    Statements

    Identifiers