MaxSAT Resolution and Subcube Sums (Q5875950): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-degree trade-offs for sums-of-squares and positivstellensatz proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular (yet sound) proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrow Proofs May Be Maximally Long / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-Space Tradeoffs for Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near optimal seperation of tree-like and general 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: Q3304105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5769706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between systems stronger than resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for Max-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An observation on time-storage trade off / 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: Semialgebraic Proofs and Efficient Algorithm Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension Complexity of Independent Set Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangles Are Nonnegative Juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tackling the limits of resolution in SAT solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4937847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical approach to efficient Max-SAT solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a better understanding of (partial weighted) MaxSAT proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight size-degree bounds for sums-of-squares proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting Theorems for Equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long Proofs of (Seemingly) Simple Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: sgen1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-One Designs Produce Small Hard SAT Instances / rank
 
Normal rank

Latest revision as of 10:58, 31 July 2024

scientific article; zbMATH DE number 7650604
Language Label Description Also known as
English
MaxSAT Resolution and Subcube Sums
scientific article; zbMATH DE number 7650604

    Statements

    MaxSAT Resolution and Subcube Sums (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 February 2023
    0 references
    MaxSAT
    0 references
    resolution
    0 references
    proof complexity
    0 references
    conical juntas
    0 references
    Sherali-Adams
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references