Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (Q5248499)

From MaRDI portal
Revision as of 14:30, 20 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    7 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references