ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM (Q5151075)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7311435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM |
scientific article; zbMATH DE number 7311435 |
Statements
ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM (English)
0 references
16 February 2021
0 references
generic complexity
0 references
Diophantine equations
0 references
0.8347020149230957
0 references
0.7892831563949585
0 references
0.7601542472839355
0 references
0.7540792226791382
0 references
0.717517614364624
0 references
