The robustness of LWPP and WPP, with an application to graph reconstruction (Q2027204)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The robustness of LWPP and WPP, with an application to graph reconstruction |
scientific article; zbMATH DE number 7350835
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The robustness of LWPP and WPP, with an application to graph reconstruction |
scientific article; zbMATH DE number 7350835 |
Statements
The robustness of LWPP and WPP, with an application to graph reconstruction (English)
0 references
25 May 2021
0 references
structural complexity theory
0 references
robustness of counting classes
0 references
legitimate deck problem
0 references
PP-lowness
0 references
reconstruction conjecture
0 references
0 references
0 references
0.8354734
0 references
0.83378017
0 references
0.83370167
0 references
0 references
0.8334133
0 references
0.83089405
0 references
0.8300382
0 references
