THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS (Q3767321): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1070/IM1987v029n02ABEH000979 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1070/IM1987V029N02ABEH000979 / rank
 
Normal rank

Latest revision as of 18:21, 21 December 2024

scientific article
Language Label Description Also known as
English
THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS
scientific article

    Statements

    THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS (English)
    0 references
    1987
    0 references
    algorithm for quantifier elimination
    0 references
    first order theory of algebraically closed fields
    0 references
    polynomial complexity
    0 references
    0 references

    Identifiers

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