Complexity bounds for zero-test algorithms (Q2457383): 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: John R. Shackell / rank
Normal rank
 
Property / author
 
Property / author: John R. Shackell / 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/j.jsc.2006.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2146555940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Schanuel's conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on algebraic independence of logarithmic and exponential constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Nullstellensatz for arbitrary ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transcendental numbers and diophantine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to recognize zero? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Equivalence in Function Fields Defined by Algebraic Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast evaluation of holonomic functions near and in regular singularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relax, but don't be too lazy / rank
 
Normal rank

Latest revision as of 10:35, 27 June 2024

scientific article
Language Label Description Also known as
English
Complexity bounds for zero-test algorithms
scientific article

    Statements

    Complexity bounds for zero-test algorithms (English)
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    Zero-test
    0 references
    power series
    0 references
    complexity
    0 references
    Pfaffian series
    0 references
    witness conjecture
    0 references

    Identifiers