Simple Local Search Problems that are Hard to Solve (Q3204045)
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: Simple Local Search Problems that are Hard to Solve |
scientific article; zbMATH DE number 4180802
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple Local Search Problems that are Hard to Solve |
scientific article; zbMATH DE number 4180802 |
Statements
Simple Local Search Problems that are Hard to Solve (English)
0 references
1991
0 references
graph partitioning
0 references
satisfiability
0 references
max-cut
0 references
complexity theory
0 references
algorithms
0 references
local search
0 references
connectionist network
0 references
local optimum
0 references
0.9063214
0 references
0.8991201
0 references
0.8948635
0 references
0 references
0.8753756
0 references
