Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy (Q3595406): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/11830924_36 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2144537400 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:39, 19 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
