Parameterized proof complexity (Q451111): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4218929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turing way to parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Upper Bounds for Vertex Cover / 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: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs as Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity gap for tree resolution / rank
 
Normal rank

Latest revision as of 17:47, 5 July 2024

scientific article
Language Label Description Also known as
English
Parameterized proof complexity
scientific article

    Statements

    Parameterized proof complexity (English)
    0 references
    0 references
    0 references
    0 references
    21 September 2012
    0 references
    propositional proof complexity
    0 references
    parameterized complexity
    0 references
    complexity gap theorems
    0 references

    Identifiers