Nonconstructive tools for proving polynomial-time decidability (Q3798236)
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 4064480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonconstructive tools for proving polynomial-time decidability |
scientific article; zbMATH DE number 4064480 |
Statements
Nonconstructive tools for proving polynomial-time decidability (English)
0 references
1988
0 references
graph minors
0 references
nonconstructive proofs
0 references
polynomial-time complexity
0 references
well- partial orders
0 references
0.814160168170929
0 references
0.804291307926178
0 references
0.7550130486488342
0 references
0.7420032620429993
0 references
