THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS (Q3767321): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:24, 5 February 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
