Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> (Q5444705): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The strength of replacement in weak arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating the bounded arithmetic and polynomial time hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded queries to SAT and the Boolean hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and definability in general bounded arithmetic theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded arithmetic and the polynomial hierarchy / rank
 
Normal rank

Latest revision as of 16:57, 27 June 2024

scientific article; zbMATH DE number 5240880
Language Label Description Also known as
English
Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>
scientific article; zbMATH DE number 5240880

    Statements

    Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> (English)
    0 references
    0 references
    0 references
    25 February 2008
    0 references
    bounded arithmetic
    0 references
    collapse of the polynomial hierarchy
    0 references
    nonuniform complexity classes
    0 references
    proof systems with advice
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references