Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (Q5248499): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:17, 8 February 2024
scientific article; zbMATH DE number 6434243
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions |
scientific article; zbMATH DE number 6434243 |
Statements
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (English)
0 references
7 May 2015
0 references
