An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic (Q4308607)

From MaRDI portal
Revision as of 20:01, 6 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 650776
Language Label Description Also known as
English
An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
scientific article; zbMATH DE number 650776

    Statements

    An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic (English)
    0 references
    0 references
    0 references
    9 October 1994
    0 references
    fragments of arithmetic
    0 references
    definable functions
    0 references
    proof theory
    0 references
    Boolean complexity
    0 references
    bounded arithmetic
    0 references
    polynomial local search
    0 references

    Identifiers