Q5092479 (Q5092479): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.CCC.2020.28 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Mutilated chessboard problem is exponentially hard for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Complexity in Propositional Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators in Propositional Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard on average for regular resolution / 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: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5769706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution proofs of generalized pigeonhole principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular resolution lower bounds for the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution lower bounds for the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution lower bounds for the weak functional pigeonhole principle. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution lower bounds for perfect matching principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution / 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: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution proofs of matching principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Width versus size in resolution proofs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.CCC.2020.28 / rank
 
Normal rank

Latest revision as of 15:54, 30 December 2024

scientific article; zbMATH DE number 7561756
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7561756

    Statements

    21 July 2022
    0 references
    proof complexity
    0 references
    resolution
    0 references
    weak pigeonhole principle
    0 references
    perfect matching
    0 references
    sparse graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers