Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Andre Galligo / rank
Normal rank
 
Property / author
 
Property / author: Andre Galligo / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing syzygies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the determinant in small parallel time using a small number of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3712417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the degrees in the Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3719722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3717026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Effective Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3272926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fields of large transcendence degree generated by values of elliptic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word problems for commutative semigroups and polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions in Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of linear problems in fields / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-4049(90)90159-f / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078730239 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:34, 30 July 2024

scientific article
Language Label Description Also known as
English
Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
scientific article

    Statements

    Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    fast quantifier elimination
    0 references
    elementary theory of algebraically closed fields
    0 references
    parallelism
    0 references
    algorithms
    0 references

    Identifiers

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