Complexity lower bounds for randomized computation trees over zero characteristic fields (Q1587344)

From MaRDI portal





scientific article
Language Label Description Also known as
English
Complexity lower bounds for randomized computation trees over zero characteristic fields
scientific article

    Statements

    Complexity lower bounds for randomized computation trees over zero characteristic fields (English)
    0 references
    0 references
    6 February 2001
    0 references
    nonlinear complexity lower bounds
    0 references
    randomized computation trees
    0 references

    Identifiers