A note on the complexity of local search problems (Q673814)
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 985782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of local search problems |
scientific article; zbMATH DE number 985782 |
Statements
A note on the complexity of local search problems (English)
0 references
28 February 1997
0 references
Combinatorial problems
0 references
Theory of computation
0 references
Local search
0 references
0.9131692051887512
0 references
0.8760308027267456
0 references
0.8587082624435425
0 references
