A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (Q3540180): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59903873, #quickstatements; #temporary_batch_1705080783594
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1503766551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / 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: Q4418680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competing provers yield improved Karp-Lipton collapse results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting in bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Collapse Consequences of NP Having Small Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional proof systems, the consistency of first order theories and the complexity of computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded arithmetic and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an optimal propositional proof system and the structure of easy subsets of TAUT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on polynomially bounded arithmetic / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:48, 28 June 2024

scientific article
Language Label Description Also known as
English
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
scientific article

    Statements

    A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (English)
    0 references
    0 references
    0 references
    20 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    Karp-Lipton theorem
    0 references
    advice
    0 references
    optimal propositional proof systems
    0 references
    bounded arithmetic
    0 references
    Extended Frege
    0 references
    0 references
    0 references