On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for k-DNF resolution on random 3-CNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Complexity in Propositional Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the automatizability of resolution and related propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the weak pigeonhole principle and random formulas beyond resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of random formulae in resolution / 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: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of resolution with bounded conjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrow Proofs May Be Spacious:Separating Space and Width in Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302095 / 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: Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Switching Lemma for Small Restrictions and Lower Bounds for <i>k</i>-DNF Resolution / rank
 
Normal rank

Latest revision as of 05:51, 4 July 2024

scientific article
Language Label Description Also known as
English
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution
scientific article

    Statements

    On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (English)
    0 references
    0 references
    0 references
    6 July 2011
    0 references

    Identifiers