On Kolmogorov complexity in the real Turing machine setting (Q293323): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q423885
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Luis Miguel Pardo / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q4372496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3280357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds in algebraic computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intrinsic complexity of elimination theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for polynomials with algebraic coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials with Rational Coefficients Which are Hard to Compute / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polynomials that are hard to compute / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5798024 / rank
 
Normal rank

Latest revision as of 02:38, 12 July 2024

scientific article
Language Label Description Also known as
English
On Kolmogorov complexity in the real Turing machine setting
scientific article

    Statements

    On Kolmogorov complexity in the real Turing machine setting (English)
    0 references
    0 references
    0 references
    9 June 2016
    0 references
    real computation
    0 references
    algebaric complexity theory
    0 references
    real Turing machines
    0 references
    straight-line complexity
    0 references
    Kolmogorov complexity
    0 references

    Identifiers