An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic (Q4308607): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Samuel R. Buss / rank
Normal rank
 
Property / author
 
Property / author: Samuel R. Buss / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1112/plms/s3-69.1.1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133313069 / rank
 
Normal rank

Latest revision as of 20:25, 19 March 2024

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