The solution of some random NP-hard problems in polynomial expected time (Q3031922): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:37, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The solution of some random NP-hard problems in polynomial expected time |
scientific article |
Statements
The solution of some random NP-hard problems in polynomial expected time (English)
0 references
1989
0 references
graph partitioning
0 references
average-case complexity
0 references
NP-complete
0 references
Graph k- colourability
0 references
Small equitable cut
0 references
3-Partition
0 references
