Relating the bounded arithmetic and polynomial time hierarchies (Q1899144): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4325772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3476809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fragments of Bounded Arithmetic and Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded arithmetic and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and feasibility in arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the scheme of induction for bounded arithmetic formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on polynomially bounded arithmetic / rank
 
Normal rank

Revision as of 17:31, 23 May 2024

scientific article
Language Label Description Also known as
English
Relating the bounded arithmetic and polynomial time hierarchies
scientific article

    Statements

    Relating the bounded arithmetic and polynomial time hierarchies (English)
    0 references
    0 references
    4 October 1995
    0 references
    0 references
    finite axiomatizability
    0 references
    bounded arithmetic
    0 references
    polynomial time hierarchy
    0 references