Feasible real random access machines (Q1279912): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710461151948
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcom.1998.0488 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974032946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\delta\)-uniform BSS machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive characterization of computable real-valued functions and relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Multiple-Precision Evaluation of Elementary Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the definitions of computable real continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5848892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real number model in numerical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-gcd computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast online multiplication of real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of online computations of real functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type 2 computational complexity of functions on Cantor's space / rank
 
Normal rank

Revision as of 17:25, 28 May 2024

scientific article
Language Label Description Also known as
English
Feasible real random access machines
scientific article

    Statements

    Identifiers