Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1370854
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexander A. Razborov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1572996061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution Is Not Automatizable Unless W[P] Is Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The resolution complexity of independent sets and vertex covers in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficiency of Resolution and Davis--Putnam Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of DPLL Search Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for cutting planes proofs with small coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size proofs of the propositional pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of maximality and minimality problems / 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: Parameterized proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing parameterized complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity gap for tree resolution / rank
 
Normal rank

Latest revision as of 05:51, 4 July 2024

scientific article
Language Label Description Also known as
English
Parameterized Bounded-Depth Frege Is Not Optimal
scientific article

    Statements

    Parameterized Bounded-Depth Frege Is Not Optimal (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 July 2011
    0 references

    Identifiers