On the complexity of the parity argument and other inefficient proofs of existence (Q1329155)
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 598086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the parity argument and other inefficient proofs of existence |
scientific article; zbMATH DE number 598086 |
Statements
On the complexity of the parity argument and other inefficient proofs of existence (English)
0 references
13 February 1995
0 references
search problems
0 references
Hamiltonian cubic graph
0 references
0.8286656141281128
0 references
0.8100519776344299
0 references
0.7883140444755554
0 references
0.7843382954597473
0 references
