Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy (Q3595406): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 11:57, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy |
scientific article |
Statements
Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy (English)
0 references
28 August 2007
0 references
