The provably total search problems of bounded arithmetic (Q3018648)

From MaRDI portal
Revision as of 19:54, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The provably total search problems of bounded arithmetic
scientific article

    Statements

    The provably total search problems of bounded arithmetic (English)
    0 references
    0 references
    0 references
    0 references
    27 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial principles
    0 references
    NP search problems
    0 references
    bounded arithmetic hierarchy
    0 references
    reductions between games
    0 references
    resolution lower bound
    0 references
    multiparty communication protocols
    0 references
    0 references