Absoluteness of subword inequality is undecidable (Q764348)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Absoluteness of subword inequality is undecidable |
scientific article; zbMATH DE number 6014328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Absoluteness of subword inequality is undecidable |
scientific article; zbMATH DE number 6014328 |
Statements
Absoluteness of subword inequality is undecidable (English)
0 references
13 March 2012
0 references
subword history
0 references
subword inequality
0 references
Hilbert's 10th problem
0 references
Diophantine equation
0 references
undecidability
0 references
NP-hardness
0 references
absoluteness problem
0 references
equality problem
0 references
0.8986203074455261
0 references
0.8510516285896301
0 references
0.7889498472213745
0 references
0.757612407207489
0 references
0.7524814605712891
0 references
