Complexity of Bezout's theorem. V: Polynomial time (Q1338222): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q941785 / rank
Normal rank
 
Property / author
 
Property / author: Stephen Smale / 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.1016/0304-3975(94)90122-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063917062 / 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: Separation of complexity classes in Koiran's weak model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's Theorem I: Geometric Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. III: Condition number and packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental theorem of algebra and complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3816922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Remarks on the Foundations of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kinematic formula in Riemannian homogeneous spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110292 / rank
 
Normal rank

Latest revision as of 09:35, 23 May 2024

scientific article
Language Label Description Also known as
English
Complexity of Bezout's theorem. V: Polynomial time
scientific article

    Statements

    Complexity of Bezout's theorem. V: Polynomial time (English)
    0 references
    0 references
    0 references
    26 September 1996
    0 references
    complexity
    0 references
    Bezout's theorem
    0 references
    algorithms
    0 references
    approximate zero
    0 references
    system of polynomial equations
    0 references
    polynomial time
    0 references
    number of arithmetic operations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references