MaxSAT Resolution and Subcube Sums
From MaRDI portal
Publication:5875950
Cites work
- scientific article; zbMATH DE number 2086404 (Why is no real title available?)
- scientific article; zbMATH DE number 1404230 (Why is no real title available?)
- scientific article; zbMATH DE number 1445296 (Why is no real title available?)
- scientific article; zbMATH DE number 3029852 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- A logical approach to efficient Max-SAT solving
- An observation on time-storage trade off
- Boolean function complexity. Advances and frontiers.
- Circular (yet sound) proofs
- Computational Complexity
- Equivalence between systems stronger than resolution
- Extension complexity of independent set polytopes
- Hard examples for resolution
- Lifting Theorems for Equality
- Long proofs of (seemingly) simple formulas
- Narrow proofs may be maximally long
- Near optimal seperation of tree-like and general resolution
- On tackling the limits of resolution in SAT solving
- Rectangles are nonnegative juntas
- Resolution for Max-SAT
- Semialgebraic Proofs and Efficient Algorithm Design
- Sgen1, a generator of small but difficult satisfiability benchmarks
- Short proofs are narrow—resolution made simple
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs
- Size-space tradeoffs for resolution
- The Complexity of Propositional Proofs
- The intractability of resolution
- The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs
- The relative efficiency of propositional proof systems
- Tight size-degree bounds for sums-of-squares proofs
- Towards a better understanding of (partial weighted) MaxSAT proof systems
- Zero-One Designs Produce Small Hard SAT Instances
This page was built for publication: MaxSAT Resolution and Subcube Sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875950)
