THE COMPLEXITY OF THE DECISION PROBLEM FOR THE FIRST ORDER THEORY OF ALGEBRAICALLY CLOSED FIELDS (Q3767321): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1070/im1987v029n02abeh000979 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979600155 / rank | |||
Normal rank | |||
Revision as of 09:05, 30 July 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
