Understanding PPA-completeness (Q2208253)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7265473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Understanding PPA-completeness |
scientific article; zbMATH DE number 7265473 |
Statements
Understanding PPA-completeness (English)
0 references
23 October 2020
0 references
fixed-point computation
0 references
PPA-completeness
0 references
oracle model complexity
0 references
0 references
0 references
0 references
0.7831261
0 references
0 references
0 references
0 references
