MaxSAT Resolution and Subcube Sums
From MaRDI portal
Publication:5875950
DOI10.1145/3565363OpenAlexW3027534747MaRDI QIDQ5875950FDOQ5875950
Authors: Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals 
Publication date: 7 February 2023
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3565363
Cites Work
- Computational Complexity
- Hard examples for resolution
- Boolean function complexity. Advances and frontiers.
- An observation on time-storage trade off
- A Machine-Oriented Logic Based on the Resolution Principle
- The relative efficiency of propositional proof systems
- The Complexity of Propositional Proofs
- Short proofs are narrow—resolution made simple
- The intractability of resolution
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A logical approach to efficient Max-SAT solving
- Resolution for Max-SAT
- Near optimal seperation of tree-like and general resolution
- Circular (yet sound) proofs
- Extension complexity of independent set polytopes
- Tight size-degree bounds for sums-of-squares proofs
- Size-space tradeoffs for resolution
- Lifting Theorems for Equality
- Semialgebraic Proofs and Efficient Algorithm Design
- Rectangles are nonnegative juntas
- On tackling the limits of resolution in SAT solving
- Narrow proofs may be maximally long
- The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs
- Equivalence between systems stronger than resolution
- Towards a better understanding of (partial weighted) MaxSAT proof systems
- Title not available (Why is that?)
- Zero-One Designs Produce Small Hard SAT Instances
- Sgen1, a generator of small but difficult satisfiability benchmarks
- Long proofs of (seemingly) simple formulas
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)
