The solution of some random NP-hard problems in polynomial expected time (Q3031922): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q56324140, #quickstatements; #temporary_batch_1712101902020 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(89)90001-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016776056 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56324140 / rank | |||
Normal rank | |||
Latest revision as of 01:27, 3 April 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
